299. Bulls and Cows
2016-08-31 16:11
281 查看
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:
Hint:
and
(The bull is
the cows are
Write a function to return a hint according to the secret number and friend's guess, use
indicate the bulls and
return
Please note that both secret number and friend's guess may contain duplicate digits, for example:
In this case, the 1st
friend's guess is a bull, the 2nd or 3rd
a cow, and your function should return
You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.
利用 map判断出现的次数,如果有出现判断是否在对应位置,如果是 bull++.
再遍历两个map,sum+=min(m[i],m2[i]);
class Solution {
public:
string getHint(string secret, string guess) {
int len=secret.size();
int bull=0;
int cow=0;
if (len==0) return NULL;
map<char,int> m;
map<char,int> m2;
for(int i=0;i<len;i++){
m[secret[i]]++;
}
for(int i=0;i<len;i++){
m2[guess[i]]++;
if(m[guess[i]] && (guess[i]==secret[i]))
bull+=1;
}
int sum=0;
for (int i=0;i<m.size();i++){
sum+=min(m[i],m2[i]);
}
char buff[20];
sprintf(buff, "%dA%dB", bull, sum-bull);
return buff;
}
};
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:
1bull
and
3cows.
(The bull is
8,
the cows are
0,
1and
7.)
Write a function to return a hint according to the secret number and friend's guess, use
Ato
indicate the bulls and
Bto 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
1in
friend's guess is a bull, the 2nd or 3rd
1is
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.
利用 map判断出现的次数,如果有出现判断是否在对应位置,如果是 bull++.
再遍历两个map,sum+=min(m[i],m2[i]);
class Solution {
public:
string getHint(string secret, string guess) {
int len=secret.size();
int bull=0;
int cow=0;
if (len==0) return NULL;
map<char,int> m;
map<char,int> m2;
for(int i=0;i<len;i++){
m[secret[i]]++;
}
for(int i=0;i<len;i++){
m2[guess[i]]++;
if(m[guess[i]] && (guess[i]==secret[i]))
bull+=1;
}
int sum=0;
for (int i=0;i<m.size();i++){
sum+=min(m[i],m2[i]);
}
char buff[20];
sprintf(buff, "%dA%dB", bull, sum-bull);
return buff;
}
};
相关文章推荐
- leetcode299. Bulls and Cows
- LeetCode299. Bulls and Cows
- [LeetCode]299. Bulls and Cows
- [leetcode]299. Bulls and Cows
- 299. Bulls and Cows
- 299. Bulls and Cows 自己写已ac
- LeetCode 299. Bulls and Cows
- 【一天一道LeetCode】#299. Bulls and Cows
- 299. Bulls and Cows
- leetcode 299. Bulls and Cows
- 299. Bulls and Cows
- leetcode 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- 299. Bulls and Cows
- Leetcode:299. Bulls and Cows(JAVA)
- 299. Bulls and Cows
- 【leetcode】299. Bulls and Cows
- [LeetCode]--299. Bulls and Cows
- leetcode 299. Bulls and Cows
- [Leetcode]299. Bulls and Cows