update: 299

Author: hijiangtao

README.md

@@ -66,6 +66,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
 |207|[Course Schedule](https://leetcode.com/problems/course-schedule/) | [JavaScript](./src/course-schedule/res.js)|Medium|
 |210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | [JavaScript](./src/course-schedule-ii/res.js)|Medium|
 |240|[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [JavaScript](./src/search-a-2d-matrix-ii/res.js)|Medium|
+|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) | [JavaScript](./src/bulls-and-cows/res.js)|Medium|
 |307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/) | [JavaScript](./src/range-sum-query-mutable/res.js)|Medium|
 |310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/) | [JavaScript](./src/minimum-height-trees/res.js)|Medium|
 |342|[Power of Four](https://leetcode.com/problems/power-of-four/) | [JavaScript](./src/power-of-four/res.js)|Easy|

src/bulls-and-cows/res.js

@@ -0,0 +1,32 @@
+/**
+ * @param {string} secret
+ * @param {string} guess
+ * @return {string}
+ */
+var getHint = function(secret, guess) {
+    const arrLen = secret.length;
+    let strA = 0;
+    let strB = 0;
+    let secMap = new Array(10);
+    let gueMap = new Array(10);
+
+    for (let index = 0; index < arrLen; index++) {
+      if (secret[index] === guess[index]) {
+        strA++;
+      } else {
+        const secNum = parseInt(secret[index]);
+        const guenum = parseInt(guess[index]);
+
+        (secMap[secNum] ? secMap[secNum] += 1 : secMap[secNum] = 1);
+        (gueMap[guenum] ? gueMap[guenum] += 1 : gueMap[guenum] = 1);
+      }
+    }
+
+    for (let index = 0; index < 10; index++) {
+      strB += (secMap[index] && gueMap[index] && (secMap[index] > gueMap[index] ? gueMap[index] : secMap[index]) || 0);
+    }
+
+    // console.log(secMap, gueMap);
+
+    return `${strA}A${strB}B`;
+};