Commitf304527

committed

add 299

1 parent4d1c6a2 commitf304527Copy full SHA for f304527

File tree

+36

-4

lines changed

+36

-4

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`* 1. check if t[i] is in the map. If yes, find out the key associated with t[i]`
`8`	`8`	`* if key exists, but s[i] is not equal to key, return false;`
`9`	`9`	`* if key is null, but s[i] exists in the map and map[s[i]] is not equal to t[i]`
`10`		`- * return false.`
	`10`	`+ * return false.`
`11`	`11`	`*`
`12`	`12`	`*@param {string} s`
`13`	`13`	`*@param {string} t`
`@@ -33,7 +33,7 @@ var isIsomorphic = function(s, t) {`
`33`	`33`	`Object.prototype.getKeyByValue=function(value){`
`34`	`34`	`for(varpropinthis){`
`35`	`35`	`if(this.hasOwnProperty(prop)){`
`36`		`-if(this[prop]===value)`
	`36`	`+if(this[prop]===value)`
`37`	`37`	`returnprop;`
`38`	`38`	`}`
`39`	`39`	`}`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@`
`6`	`6`	`// remember: anagram also requires the appearance of the letter in both strings is same.`
`7`	`7`	`varisAnagram=function(s,t){`
`8`	`8`	`varisAnagram=true;`
`9`		`-if(s.length!==t.length){returnfalse;}`
	`9`	`+if(s.length!==t.length)returnfalse;`
`10`	`10`	`varsObject={};`
`11`	`11`	`for(vari=0;i<s.length;i++){`
`12`	`12`	`sObject[s[i]] ?sObject[s[i]]++ :(sObject[s[i]]=1);`
`@@ -19,7 +19,7 @@ var isAnagram = function(s, t) {`
`19`	`19`	`if(!tObject.hasOwnProperty(key)){`
`20`	`20`	`isAnagram=false;`
`21`	`21`	`break;`
`22`		`-}elseif(sObject[key]!==tObject[key]){`
	`22`	`+}elseif(sObject[key]!==tObject[key]){`
`23`	`23`	`isAnagram=false;`
`24`	`24`	`break;`
`25`	`25`	`}`

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+/**`
	`2`	`+ * Key two rounds`
	`3`	`+ * 1. first round scan to build the map (number -> appearances), if secret[i] === guess[i], bull++`
	`4`	`+ * if it's not a bull, increase the cow appearances in the map`
	`5`	`+ * 2. second round, skip the bull positions and compare the guess number and the map`
	`6`	`+ * if there is a cow, cow++ and decrease the cow number from the map. if the cow number is 0`
	`7`	`+ * that is, there is matched cow number between secrect and guess.`
	`8`	`+ *`
	`9`	`+ *@param {string} secret`
	`10`	`+ *@param {string} guess`
	`11`	`+ *@return {string}`
	`12`	`+ */`
	`13`	`+vargetHint=function(secret,guess){`
	`14`	`+varsecretMap={};`
	`15`	`+varcow=0;`
	`16`	`+varbull=0;`
	`17`	`+`
	`18`	`+for(vari=0;i<secret.length;i++){`
	`19`	`+if(secret[i]===guess[i])bull++;`
	`20`	`+elseif(secretMap[secret[i]])secretMap[secret[i]]++;`
	`21`	`+elsesecretMap[secret[i]]=1;`
	`22`	`+}`
	`23`	`+for(varj=0;j<guess.length;j++){`
	`24`	`+console.log(secretMap[guess[j]]);`
	`25`	`+if(guess[j]!==secret[j]&&secretMap[guess[j]]){`
	`26`	`+cow++;`
	`27`	`+secretMap[guess[j]]--;`
	`28`	`+}`
	`29`	`+}`
	`30`	`+`
	`31`	`+returnbull+'A'+cow+'B';`
	`32`	`+};`

Comments

(0)