feat: add solutions to leetcode problem: No.0299

Author: yanglbme

solution/0200-0299/0299.Bulls and Cows/README.md

@@ -40,15 +40,50 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def getHint(self, secret: str, guess: str) -> str:
+        a_cnt = b_cnt = 0
+        nums1 = dict()
+        nums2 = dict()
+        for i in range(len(secret)):
+            if secret[i] == guess[i]:
+                a_cnt += 1
+            else:
+                nums1[secret[i]] = nums1.get(secret[i], 0) + 1
+                nums2[guess[i]] = nums2.get(guess[i], 0) + 1
+        for i, v in nums1.items():
+            if i in nums2:
+                b_cnt += min(v, nums2[i])
+        return f'{a_cnt}A{b_cnt}B'
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String getHint(String secret, String guess) {
+        int aCnt = 0, bCnt = 0;
+        Map<Character, Integer> nums1 = new HashMap<>();
+        Map<Character, Integer> nums2 = new HashMap<>();
+        for (int i = 0; i < secret.length(); ++i) {
+            if (secret.charAt(i) == guess.charAt(i)) {
+                ++aCnt;
+            } else {
+                nums1.put(secret.charAt(i), nums1.getOrDefault(secret.charAt(i), 0) + 1);
+                nums2.put(guess.charAt(i), nums2.getOrDefault(guess.charAt(i), 0) + 1);
+            }
+        }
+
+        for (Map.Entry<Character, Integer> entry : nums1.entrySet()) {
+            if (nums2.containsKey(entry.getKey())) {
+                bCnt += Math.min(entry.getValue(), nums2.get(entry.getKey()));
+            }
+        }
+        return String.format("%dA%dB", aCnt, bCnt);
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0299.Bulls and Cows/README_EN.md

@@ -47,13 +47,48 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def getHint(self, secret: str, guess: str) -> str:
+        a_cnt = b_cnt = 0
+        nums1 = dict()
+        nums2 = dict()
+        for i in range(len(secret)):
+            if secret[i] == guess[i]:
+                a_cnt += 1
+            else:
+                nums1[secret[i]] = nums1.get(secret[i], 0) + 1
+                nums2[guess[i]] = nums2.get(guess[i], 0) + 1
+        for i, v in nums1.items():
+            if i in nums2:
+                b_cnt += min(v, nums2[i])
+        return f'{a_cnt}A{b_cnt}B'
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String getHint(String secret, String guess) {
+        int aCnt = 0, bCnt = 0;
+        Map<Character, Integer> nums1 = new HashMap<>();
+        Map<Character, Integer> nums2 = new HashMap<>();
+        for (int i = 0; i < secret.length(); ++i) {
+            if (secret.charAt(i) == guess.charAt(i)) {
+                ++aCnt;
+            } else {
+                nums1.put(secret.charAt(i), nums1.getOrDefault(secret.charAt(i), 0) + 1);
+                nums2.put(guess.charAt(i), nums2.getOrDefault(guess.charAt(i), 0) + 1);
+            }
+        }
+
+        for (Map.Entry<Character, Integer> entry : nums1.entrySet()) {
+            if (nums2.containsKey(entry.getKey())) {
+                bCnt += Math.min(entry.getValue(), nums2.get(entry.getKey()));
+            }
+        }
+        return String.format("%dA%dB", aCnt, bCnt);
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0299.Bulls and Cows/Solution.java

@@ -1,54 +1,22 @@
-public class Solution {
+class Solution {
     public String getHint(String secret, String guess) {
-
-		if (secret == null || guess == null
-				|| secret.length() != guess.length()) {
-			return "";
-		}
-
-		char[] s = secret.toCharArray();
-		char[] g = guess.toCharArray();
-
-		int A = 0, B = 0;
-
-		// 统计bulls
-		for (int i = 0; i < s.length; i++) {
-			if (s[i] == g[i]) {
-				s[i] = '#';
-				g[i] = '#';
-				A++;
-			}
-		}
-
-		// 统计cows
-
-		Map<Character, Integer> map = new HashMap<Character, Integer>();
-
-		for (int i = 0; i < s.length; i++) {
-			if (s[i] != '#') {
-				if (!map.containsKey(s[i])) {
-					map.put(s[i], 1);
-				} else {
-					int times = map.get(s[i]);
-					times++;
-					map.put(s[i], times);
-				}
-			}
-		}
-
-		for (int i = 0; i < g.length; i++) {
-			if (g[i] != '#') {
-				if (map.containsKey(g[i]) && map.get(g[i]) != 0) {
-					int times = map.get(g[i]);
-					times--;
-					map.put(g[i], times);
-					B++;
-				}
-			}
-		}
-
-		return A + "A" + B + "B";
-	
+        int aCnt = 0, bCnt = 0;
+        Map<Character, Integer> nums1 = new HashMap<>();
+        Map<Character, Integer> nums2 = new HashMap<>();
+        for (int i = 0; i < secret.length(); ++i) {
+            if (secret.charAt(i) == guess.charAt(i)) {
+                ++aCnt;
+            } else {
+                nums1.put(secret.charAt(i), nums1.getOrDefault(secret.charAt(i), 0) + 1);
+                nums2.put(guess.charAt(i), nums2.getOrDefault(guess.charAt(i), 0) + 1);
+            }
+        }
 
+        for (Map.Entry<Character, Integer> entry : nums1.entrySet()) {
+            if (nums2.containsKey(entry.getKey())) {
+                bCnt += Math.min(entry.getValue(), nums2.get(entry.getKey()));
+            }
+        }
+        return String.format("%dA%dB", aCnt, bCnt);
     }
 }

solution/0200-0299/0299.Bulls and Cows/Solution.py

@@ -0,0 +1,15 @@
+class Solution:
+    def getHint(self, secret: str, guess: str) -> str:
+        a_cnt = b_cnt = 0
+        nums1 = dict()
+        nums2 = dict()
+        for i in range(len(secret)):
+            if secret[i] == guess[i]:
+                a_cnt += 1
+            else:
+                nums1[secret[i]] = nums1.get(secret[i], 0) + 1
+                nums2[guess[i]] = nums2.get(guess[i], 0) + 1
+        for i, v in nums1.items():
+            if i in nums2:
+                b_cnt += min(v, nums2[i])
+        return f'{a_cnt}A{b_cnt}B'