Bulls and Cows
来源:互联网 发布:矩阵乘法计算公式 编辑:程序博客网 时间:2024/04/30 19:05
这道题感觉也真是给自己新知,自己一开始有点蒙,尤其是想就一次循环把两只牛都求出来。一次求其实可以,但确实一上来有难度,这个在平时也就罢了,但在面试时咋办啊。退而求其次,就一点,找到一个能work的方法也行。
下面的做法是参考了一种两次循环的比较好的。
第一次for,求出bull的数量,同时将secret的其它字符连带数量存入map,
第二次for,求出cow的数量,比对guess
这种妥协需要有。另外今后可参考点击打开链接
public class Solution { public String getHint(String secret, String guess) { String result = "";if (secret == null || secret.length() == 0 || guess == null || guess.length() == 0) {return result;}Map<Character/*secretChar*/, Integer/*quantity*/> map = new HashMap<>();int bullCount = 0;for (int i = 0; i < secret.length(); i++) {if (secret.charAt(i) == guess.charAt(i)) {bullCount++;} else {if (map.containsKey(secret.charAt(i))) {map.put(secret.charAt(i), map.get(secret.charAt(i)) + 1);} else {map.put(secret.charAt(i), 1);}}}int cowCount = 0;for (int i = 0; i < secret.length(); i++) {if (secret.charAt(i) != guess.charAt(i)) {if (map.containsKey(guess.charAt(i))) {cowCount++;if (map.get(guess.charAt(i)) == 1) {map.remove(guess.charAt(i));} else {map.put(guess.charAt(i), map.get(guess.charAt(i)) - 1);}}}}return bullCount + "A" + cowCount + "B"; }}
0 0
- [LeetCode]Bulls and Cows
- [LeetCode] Bulls and Cows
- LeetCode Bulls and Cows
- [leetcode299]Bulls and Cows
- Bulls and Cows
- leetcode | Bulls and Cows
- Bulls and Cows
- LeetCode:Bulls and Cows
- LeetCode -- Bulls and Cows
- leetcode: Bulls and Cows
- [leetcode]Bulls and Cows
- Bulls and Cows
- Bulls and Cows
- 299. Bulls and Cows
- Bulls and Cows-LeetCode
- Leetcode191: Bulls and Cows
- [Leetcode]Bulls and Cows
- Bulls and Cows
- Web开发之初体验
- mybatis配置文件
- 理解 Cinder 架构 - 每天5分钟玩转 OpenStack(45)
- 在锁中使用多条件Condition
- Java千百问_03基础语法(016)_main方法是什么
- Bulls and Cows
- 计蒜之道 青云的机房组网方案(中等)
- AsyncTask的使用
- Opensips 进程结构
- 第15课:Spark Streaming源码解读之No Receivers彻底思考
- 什么是线程执行器Executor
- 318. Maximum Product of Word Lengths
- 【连载】大话系统架构决策 - 伸缩性
- 第七届ACM山东省赛-D Swiss-system tournament