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:

中文：假设你正在玩猜数字游戏（Bulls and Cows）：你写出4个数字让你的朋友猜，每次你的朋友猜一个数字，你给出一条线索，这个线索告诉你的朋友，有多少个数字位置是正确的（被称为Bulls），有多少个数字位置是不正确的（被称为Cows），你的朋友需要根据这些线索最终猜出正确的数字。

例如，给出的数字是1807，你的朋友猜的是7810，这里用A代表Bulls，B代表Cows，则给出的线索是1A3B。

题目中给出的secret（被猜测数字）和guess（猜测的数字）长度一定是一样的。

做这道题还需要注意，一般的猜数字游戏中，被猜的数字有四个且互不相同，但在本题中，可以有任意多个数字，且数字有可能存在同一数字重复多次出现的情况。

主要是判断出B的个数，就是数字相同但是位置不同的数，，注意的是数字可能重复出现的  1011  

class Solution {
public:
    string getHint(string secret, string guess) {
      
      int couta=0;
      int coutb=0;
      for(int i=0;i<secret.length();i++)
      {
          for(int j=0;j<guess.length();j++)
          {
              if(secret[i]==' '|| guess[i]==' ')
              {
                  continue;
              }
              else if(secret[i]==guess[j])
              {
                  if(i==j)
                  {
                      couta++;
                      secret[i]=' ';
                      guess[j]=' ';
                  }
              }
          }
      }
      for(int i=0;i<secret.length();i++)
      {
          for(int j=0;j<guess.length();j++)
          {
              if(secret[i]==' '|| guess[j]==' ')
              {
                  continue;
              }
              else if(secret[i]==guess[j])
              {
                      coutb++;
                      secret[i]=' ';
                      guess[j]=' ';
              }
          }
      }
      return to_string(couta) + "A" + to_string(coutb) + "B";
    }
};