zoukankan      html  css  js  c++  java
  • [LeetCode299]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.

    代码:

    class Solution {
    public:
        string getHint(string secret, string guess) {
            int aCount = 0;
            int bCount = 0;
            vector<int> secretVec(10,0);
            vector<int> guessVec(10,0);
            if(secret.empty())
                return "0A0B";
            for(int i = 0; i < secret.size(); ++i)
            {
                char c1 = secret[i];
                char c2 = guess[i];
                if(c1 == c2)
                {
                    ++aCount;
                }
                else
                {
                    ++secretVec[c1-'0'];
                    ++guessVec[c2-'0'];
                }
            }
            for(int i = 0; i < secretVec.size(); ++i)
            {
                bCount += min(secretVec[i],guessVec[i]);
            }
            return to_string(aCount) + "A" + to_string(bCount) + "B";
        }
    };
  • 相关阅读:
    Linux操作篇之配置Samba
    Chrome扩展实现网页图片右键上传(以E站图片搜索为例)
    Linux开机自动挂载NFS配置的一个误区
    ffmpeg指令解读海康威视摄像头
    linux服务器性能调优之tcp/ip性能调优
    多线程程序设计中的8条简单原则
    初识文件系统
    socket中的listen到底干了哪些事情?
    ip面向无连接?TCP面向连接?HTTP连接方式?
    网络层和数据链层的区别
  • 原文地址:https://www.cnblogs.com/zhangbaochong/p/5248002.html
Copyright © 2011-2022 走看看