Leetcode 299. Bulls and Cows

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

Subscribe to see which companies asked this question

Show Tags

Have you met this question in a real interview? 

Yes

 

No

Discuss Pick One

思路：先扫一遍找出bull的数目，再用两个数组分别储存非bull的数字的数目，然后一个一个比对，选最小者累加就是cow的数目。

#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<stack>
using namespace std;

/*******************************提交部分******************************************/
string fun(int n)
{
	stack<int> a;
	string s;
	if(n==0)	//注意一定要对0处理，不然会WA在第99个用例 
	{
		s="0";
	}
	else
	{
		while(n)
		{
			a.push(n%10);
			n/=10;
		}
		while(!a.empty())
		{
			s+=a.top()+'0';
			a.pop();
		}
	}
	return s;
}


class Solution
{
	public:
		string getHint(string secret, string guess)
		{
			int l=secret.size();
			int bull=0,cow=0;
			int a[10]= {0};
			int b[10]= {0};
			for(int i=0; i<l; i++)		//计算bull的部分 
			{
				if(secret[i]==guess[i])
				{
					bull++;
					secret[i]=guess[i]=-1;
				}
			}
			for(int i=0; i<l; i++)
			{
				if(secret[i]!=-1)
					a[secret[i]-'0']++;
				if(guess[i]!=-1)
					b[guess[i]-'0']++;
			}
			for(int i=0; i<10; i++)		//计算cow的部分 
			{
				if(a[i]&&b[i])
				{
					int tmp=min(a[i],b[i]);
					cow+=tmp;
				}
			}
			string ans;
			string c,d;
			c=fun(bull);	//将bull和cow转化为string类型 
			d=fun(cow);
			ans=c+"A"+d+"B";
			return ans;
		}
};
/*******************************提交部分******************************************/

int main()
{
	string s,g;
	cin>>s>>g;
	Solution gH;
	string ans=gH.getHint(s,g);
	cout<<ans<<endl;
	return 0;
}

小结：我感觉我做题的时候主要卡在将整型bull和cow转化为string类型（一开始我还天真地忽略了cow和bull不是一位数的情况，以后想问题还是得全面），用itoa函数老是报错，也搜了网上其他的一些转化方式，但也调试不行，最终还是自己手动写一个函数好了。