LeetCode:Bulls and Cows
来源:互联网 发布:双筒望远镜 知乎 编辑:程序博客网 时间:2024/05/14 10:11
问题描述:
You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called "bulls") and how many digits match the secret number but locate in the wrong position (called "cows"). Your friend will use successive guesses and hints to eventually derive the secret number.
For example:
Secret number: "1807"Friend's guess: "7810"Hint:
1
bull and 3
cows. (The bull is 8
, the cows are 0
, 1
and 7
.)Write a function to return a hint according to the secret number and friend's guess, use A
to indicate the bulls and B
to indicate the cows. In the above example, your function should return "1A3B"
.
Please note that both secret number and friend's guess may contain duplicate digits, for example:
Secret number: "1123"Friend's guess: "0111"In this case, the 1st
1
in friend's guess is a bull, the 2nd or 3rd 1
is a cow, and your function should return "1A1B"
.You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.
Credits:
Special thanks to @jeantimex for adding this problem and creating all test cases.
C++代码:
public class Solution { public String getHint(String secret, String guess) { if(secret == null || guess == null || secret.length() != guess.length()) { return ""; } int countA = 0; int countB = 0; int[] count = new int[10]; for(int i = 0; i < secret.length(); ++i) { if(secret.charAt(i) == guess.charAt(i)) { ++countA; } else { ++count[secret.charAt(i) - '0']; if (count[secret.charAt(i) - '0'] <= 0) { ++countB; } --count[guess.charAt(i)- '0']; if (count[guess.charAt(i)- '0'] >= 0) { ++countB; } } } return String.valueOf(countA) + "A" + String.valueOf(countB) + "B"; }}
- [LeetCode]Bulls and Cows
- [LeetCode] Bulls and Cows
- LeetCode Bulls and Cows
- leetcode | Bulls and Cows
- LeetCode:Bulls and Cows
- LeetCode -- Bulls and Cows
- leetcode: Bulls and Cows
- [leetcode]Bulls and Cows
- Bulls and Cows-LeetCode
- [Leetcode]Bulls and Cows
- Leetcode: Bulls and Cows
- LeetCode Bulls and Cows
- 【Leetcode】bulls and cows
- LeetCode Bulls and Cows
- LeetCode: Bulls and Cows
- Leetcode - Bulls and Cows
- LeetCode:Bulls and Cows
- 【Leetcode】Bulls and Cows
- myeclipse删除工程后出现Could not publish to the server
- 虚函数、纯虚函数通俗解释(C++,Java)
- 15-11-16 Eclipse 操作菜单汉译之Edit [编辑]
- Codeforces Gym 100796E Permutation Polygon(线段树)
- Cocos Play提升3倍转化率:手游微端革命
- LeetCode:Bulls and Cows
- dom4j 解析xml字符串 去除.DTD校验
- 印章图片制作操作手册
- java使用域账号登陆,ldap协议
- java POI 将txt文件导入到excel中
- maven compile的web项目时指定/WEB-INF/lib 目录作为额外的库目录
- SVN服务器搭建和使用(一)
- 个人博客建立(2)
- Servlet文件上传(ServletFIleUpload,DiskFileItemFactory,FileItem)