zoukankan      html  css  js  c++  java
  • Leetcode- 299. Bulls and Cows

    
    
    
    
    Total Accepted: 19397 Total Submissions: 67937 Difficulty: 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 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 bulls = 0; int cows = 0; int num[10] = { 0 }; for (int i = 0; i < guess.size(); i++) { if (secret[i] == guess[i]) { bulls = bulls + 1; } else { num[guess[i] - '0']++; } } for (int i = 0; i < secret.size(); i++) { if (secret[i] != guess[i] && num[secret[i] - '0'] > 0) { cows++; num[secret[i] - '0']--; } } char buff[20]; sprintf(buff, "%dA%dB", bulls, cows); return buff; } };

    javascript:

    /**
     * @param {string} secret
     * @param {string} guess
     * @return {string}
     */
    var getHint = function(secret, guess) {
        var i;
        var bull=0;
        var cow=0;
        var secretArr=new Array();
        var guessArr=new Array();
        for(i in secret){
           if(secret[i]===guess[i]){
               bull++;
           }
           if(secretArr[Number(secret[i])]==null){
               secretArr[Number(secret[i])]=0;
           }
           secretArr[Number(secret[i])]++;
           if(guessArr[Number(guess[i])]==null){
               guessArr[Number(guess[i])]=0;
           }
           guessArr[Number(guess[i])]++;
       }
       var sameNum=0;
       for(i in secretArr){
         //  if(secretArr[i]===guessArr[i]){
           //    sameNum+=secretArr[i];
           //}
           if(secretArr[i]!=null && guessArr[i]!=null)
           {
              if(secretArr[i]>guessArr[i]){
                   sameNum+=guessArr[i];
              }
              else{
                     sameNum+=secretArr[i];
              }
           }
       }
       var res="";
       var wp=sameNum-bull;
       res=bull+"A"+wp+"B";
       return res;
    };
  • 相关阅读:
    pyinstaller安装和使用
    django项目结构和运行项目
    安装django and 创建项目
    浅谈网络请求基础(理论篇)
    浅谈爬虫初识
    判断是否AVL平衡二叉书
    用递归方法判断两棵树是否相等
    广度优先搜索求树的深度
    堆排序
    归并排序
  • 原文地址:https://www.cnblogs.com/Decmber/p/5206814.html
Copyright © 2011-2022 走看看