Jan 13 - Bulls and Cows; String; HashSet;

直接用hashmap做的：

代码：

public class Solution {public String getHint(String secret, String guess) {if(secret == null || guess == null) return null;Map<Character, Integer> secretMap = new HashMap<>();Map<Character, Integer> guessMap = new HashMap<>();List<Character> list = new ArrayList<>();int len = secret.length();int numA = 0;int numB = 0;for(int i = 0; i < len; i++){char c1 = secret.charAt(i);char c2 = guess.charAt(i);if(c1 == c2) numA++;else{if(secretMap.containsKey(c1)) secretMap.put(c1, secretMap.get(c1)+1);else{secretMap.put(c1, 1);list.add(c1);}if(guessMap.containsKey(c2)) guessMap.put(c2, guessMap.get(c2)+1);else guessMap.put(c2, 1);}}for(int i = 0; i < list.size(); i++){char c = list.get(i);if(secretMap.containsKey(c) && guessMap.containsKey(c)) numB += Math.min(secretMap.get(c), guessMap.get(c));}return numA+"A"+numB+"B";} }

　　

转载于:https://www.cnblogs.com/5683yue/p/5129842.html

《新程序员》：云原生和全面数字化实践50位技术专家共同创作，文字、视频、音频交互阅读

总结

以上是生活随笔为你收集整理的Jan 13 - Bulls and Cows; String; HashSet;的全部内容，希望文章能够帮你解决所遇到的问题。

如果觉得生活随笔网站内容还不错，欢迎将生活随笔推荐给好友。