299. Bulls and Cows

题目:

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 01 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.

答案:

A代表的是相同位置相同元素的个数,B记录的是错位的相同元素的个数。

思路是分两遍遍历,第一遍得到countA的个数,第二遍先建两个数组,因为两个字符串里面都只有数字,所以建两个大小为10的数组分别记录Secret和Guess中0到9的个数,然后再比较这两个数组,相同位置上小的那个数被记录下来,然后再累加。

 1 class Solution {
 2 public:
 3     string getHint(string secret, string guess) {
 4         int countA=0,countB=0;
 5         int count1[10];
 6         int count2[10];
 7        memset(count1,0,sizeof(count1));
 8        memset(count2,0,sizeof(count2));
 9         for(int i=0;i<secret.length();i++){
10             if(secret[i]==guess[i]){
11                 countA++;
12             }
13             else{
14                 count1[secret[i]-‘0‘]++;
15                 count2[guess[i]-‘0‘]++;
16             }
17         }
18         for(int i=0;i<10;i++){
19             countB=countB+min(count1[i],count2[i]);
20         }
21         return to_string(countA)+"A"+to_string(countB)+"B";
22     }
23 };
时间: 2024-10-12 20:28:55

299. Bulls and Cows的相关文章

299. Bulls and Cows via java

class Solution { public String getHint(String secret, String guess) { int bull = 0; int cow = 0; int[] mem = new int[10]; for(int i =0; i<secret.length();i++){ if(secret.charAt(i)==guess.charAt(i)){ bull++; }else{ if (mem[secret.charAt(i)-'0']++ < 0

LeetCode 299. Bulls and Cows

secret和guess按位读入,如果相等bull就加1,不相等就在各自统计不同数字出现次数的数组里加1(s_map[i]指secret里数字i出现的次数).最后s_map和g_map存的是各自string中位置不等的各数值出现的次数,cow等于两个数组中相同位置的最小数. 1 class Solution { 2 public: 3 string getHint(string secret, string guess) { 4 int s_map[10] = {0}, g_map[10] =

Leetcode 299 Bulls and Cows 字符串处理 统计

A就是统计猜对的同位同字符的个数 B就是统计统计猜对的不同位同字符的个数 非常简单的题 1 class Solution { 2 public: 3 string getHint(string secret, string guess) { 4 int cntA = 0, cntB = 0; 5 int sn[10] = {0}, gn[10] = {0}; 6 for(string::size_type i = 0; i < secret.size(); ++i){ 7 if(secret[i

[leetcode299] 299. Bulls and Cows

public String getHint(String secret, String guess) { /* 判断bull 是通过比较两个字符串的每一位,每次相同就删除该字符出现的次数,因为后边的 要判断cow不能占用这些 判断cow只要检测出去被占用的还有没有该字符 */ //key记录字符,value记录出现的次数 Map<Character,Integer> map = new HashMap<>(); String res = ""; int a =

LeetCode:Bulls and Cows - 猜数字游戏

1.题目名称 Bulls and Cows(猜数字游戏) 2.题目地址 https://leetcode.com/problems/bulls-and-cows/ 3.题目内容 英文:You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret number and ask your friend to guess it, each time your friend g

LeetCode_299. Bulls and Cows

299. Bulls and Cows Easy 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 digi

leetcode 299. 猜数字游戏(Bulls and Cows)

目录 题目描述: 示例 1: 示例 2: 解法: 题目描述: 你正在和你的朋友玩 猜数字(Bulls and Cows)游戏:你写下一个数字让你的朋友猜.每次他猜测后,你给他一个提示,告诉他有多少位数字和确切位置都猜对了(称为"Bulls", 公牛),有多少位数字猜对了但是位置不对(称为"Cows", 奶牛).你的朋友将会根据提示继续猜,直到猜出秘密数字. 请写出一个根据秘密数字和朋友的猜测数返回提示的函数,用 A 表示公牛,用 B 表示奶牛. 请注意秘密数字和朋友

[LeetCode] Bulls and Cows

Bulls and Cows You are playing the following Bulls and Cows game with your friend: You write a 4-digit secret number and ask your friend to guess it, each time your friend guesses a number, you give a hint, the hint tells your friend how many digits

Java [Leetcode 229]Bulls and Cows

题目描述: 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 ma