Leetcode题解 299. Bulls and Cows
来源:互联网 发布:补水眼霜 知乎 编辑:程序博客网 时间:2024/05/21 03:19
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.
逐位比较,相等的直接+1,不等的分别存起来,最后单独比较不等的这部分,看看有哪些数字是错位的。
public class Solution { public String getHint(String secret, String guess) { int Anum=0; int Bnum=0; int[] resultA=new int[10]; int[] resultB=new int[10]; for(int i=0;i<secret.length();i++){ int tempA=secret.charAt(i)-48; int tempB=guess.charAt(i)-48; if(tempA==tempB){ Anum++; }else{ resultA[secret.charAt(i)-48]++; resultB[guess.charAt(i)-48]++; } } for(int i=0;i<10;i++){ if(resultA[i]!=0&&resultB[i]!=0){ Bnum+=resultA[i]>resultB[i]?resultB[i]:resultA[i]; } } return Anum+"A"+Bnum+"B"; }}
- Leetcode题解 299. Bulls and Cows
- leetcode题解-299. Bulls and Cows
- LeetCode题解:Bulls and Cows
- 【leetcode题解】【E】【19】299. Bulls and Cows
- LeetCode 题解(282) : Bulls and Cows
- [leetcode] 299. Bulls and Cows
- LeetCode || 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- Leetcode 299. Bulls and Cows
- LeetCode.299.Bulls and Cows
- LeetCode--299. Bulls and Cows
- 【LeetCode】299. Bulls and Cows
- [leetcode] 299. Bulls and Cows
- LeetCode *** 299. Bulls and Cows
- leetcode 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- LeetCode-299.Bulls and Cows
- Leetcode 299. Bulls and Cows
- XOJ15 最短路
- HDU 2576 Another Sum Problem
- IOS多线程开发
- 想成为 VR 开发者?不妨看看这位“女学霸”的经历
- 用PS拾色器获取RGB值
- Leetcode题解 299. Bulls and Cows
- IDA+OD双剑合璧=逆向无敌
- C++中结构体与类的区别
- hrbust 1382 Split the Points【判断正方形+判断矩形+极角排序】
- javascript ( 自定义对象--json的用法演示、Map的用法)
- 【Unity Shaders】学习笔记之为创建Half Lambert光照模型(六)
- 数学测试3
- linux 目录/sys 解析
- django 用户注册系统