[Leetcode] Bulls and Cows
来源:互联网 发布:应用程序端口号 编辑:程序博客网 时间:2024/06/05 14:28
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.
public class Solution { public String getHint(String secret, String guess) { int len=secret.length(); int A=0; int B=0; StringBuffer str=new StringBuffer(); str.append(guess); for(int i=0;i<len;i++) { if(str.charAt(i)==secret.charAt(i)) { A=A+1; str.setCharAt(i,'a'); } } for(int i=0;i<len;i++) { if(str.charAt(i)=='a') continue; int index=str.indexOf(secret.charAt(i)+""); if(index !=-1) { B=B+1; str.setCharAt(index,'b'); } } return Integer.toString(A)+"A"+Integer.toString(B)+"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
- poj2386
- AngularJS ng-checked指令
- leetcode-006 ZigZag Conversion
- 判断两个单链表是否有相同节点
- 阿里大于短信平台 Python3 初体验
- [Leetcode] Bulls and Cows
- git学习
- 最小化安装CentOS7的网卡设置
- [computational probability]1 probability and inference
- Android找不到R文件
- 开发者头条(四):加入Design :TabLayout + Toolbar
- 第45课 Spark 2.0实战之Dataset:map、flatMap、mapPartitions、dropDuplicate、coalesce、repartition等
- SQL总结之跨数据库服务器之间的数据访问(MSSQL)
- MySQL 查询 select * from table where id in 如何提高效率?