solve problem Bulls And Cows

Author: P-ppc

README.md

@@ -308,6 +308,7 @@ All solutions will be accepted!
 |701|[Insert Into A Binary Search Tree](https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/description/)|[java/py/js](./algorithms/InsertIntoABinarySearchTree)|Medium|
 |165|[Compare Version Numbers](https://leetcode-cn.com/problems/compare-version-numbers/description/)|[java/py/js](./algorithms/CompareVersionNumbers)|Medium|
 |8|[String To Integer Atoi](https://leetcode-cn.com/problems/string-to-integer-atoi/description/)|[java/py/js](./algorithms/StringToIntegerAtoi)|Medium|
+|299|[Bulls And Cows](https://leetcode-cn.com/problems/bulls-and-cows/description/)|[java/py/js](./algorithms/BullsAndCows)|Medium|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/BullsAndCows/README.md

@@ -0,0 +1,2 @@
+# Bulls And Cows
+We can solve this problem by hashmap

algorithms/BullsAndCows/Solution.java

@@ -0,0 +1,31 @@
+class Solution {
+    public String getHint(String secret, String guess) {
+        int bullCount = 0,
+            cowCount = 0;
+        Map<Character, Integer> valueMap = new HashMap<Character, Integer>();
+        List<Character> guessRemains = new ArrayList<Character>();
+        
+        for (int i = 0; i < secret.length(); i++) {
+            if (secret.charAt(i) == guess.charAt(i))
+                bullCount++;
+            else {
+                if (valueMap.get(secret.charAt(i)) == null)
+                    valueMap.put(secret.charAt(i), 1);
+                else
+                    valueMap.put(secret.charAt(i), valueMap.get(secret.charAt(i)) + 1);
+                guessRemains.add(guess.charAt(i));
+            }
+        }
+        
+        for (int i = 0; i < guessRemains.size(); i++) {
+            char c = guessRemains.get(i);
+            Integer v = valueMap.get(c);
+            if (v != null && v > 0) {
+                cowCount++;
+                valueMap.put(c, v - 1);
+            }
+        }
+        
+        return String.format("%dA%dB", bullCount, cowCount);
+    }
+}

algorithms/BullsAndCows/solution.js

@@ -0,0 +1,31 @@
+/**
+ * @param {string} secret
+ * @param {string} guess
+ * @return {string}
+ */
+var getHint = function(secret, guess) {
+    let bullCount = 0,
+        cowCount = 0,
+        valueMap = {},
+        guessRemains = []
+    
+    for (let i = 0; i < secret.length; i++) {
+        if (secret[i] == guess[i])
+            bullCount++
+        else {
+            if (valueMap[secret[i]] === undefined)
+                valueMap[secret[i]] = 0
+            valueMap[secret[i]]++
+            guessRemains.push(guess[i])
+        }
+    }
+    
+    guessRemains.forEach(v => {
+        if (valueMap[v] !== undefined && valueMap[v] > 0) {
+            cowCount++
+            valueMap[v]--
+        }
+    })
+    
+    return `${bullCount}A${cowCount}B`
+};

algorithms/BullsAndCows/solution.py

@@ -0,0 +1,25 @@
+class Solution(object):
+    def getHint(self, secret, guess):
+        """
+        :type secret: str
+        :type guess: str
+        :rtype: str
+        """
+        bull_count = 0
+        cow_count = 0
+        value_map = {}
+        guess_remains = []
+        
+        for i in xrange(len(secret)):
+            if secret[i] == guess[i]:
+                bull_count += 1
+            else:
+                value_map[secret[i]] = 1 if value_map.get(secret[i]) == None else value_map.get(secret[i]) + 1
+                guess_remains.append(guess[i])
+                
+        for v in guess_remains:
+            if value_map.get(v) != None and value_map.get(v) > 0:
+                cow_count += 1
+                value_map[v] -= 1
+                
+        return '%dA%dB' % (bull_count, cow_count)