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

    Credits:
    Special thanks to @jeantimex for adding this problem and creating all test cases.

    本题是以前文曲星里面的游戏,如果猜对数字和位置,则bulls+1,如果只是猜对数字,那么cows+1;

    想法是,创建一个共享数组,首先判断是否数字和位置相同,如果相同,则bulls+1,否则的话把secret的字符-‘0’值+1,然后guess的同理-1,代码如下:

     1 public class Solution {
     2     public String getHint(String secret, String guess) {
     3         int bulls = 0;
     4         int cows = 0;
     5         int[] num = new int[10];
     6         for(int i=0;i<secret.length();i++){
     7             if(secret.charAt(i)==guess.charAt(i)) bulls++;
     8             else{
     9                 if(num[secret.charAt(i)-'0']++<0) cows++;
    10                 if(num[guess.charAt(i)-'0']-->0) cows++;
    11             }
    12         }
    13         String s = bulls+"A"+cows+"B";
    14         return s;
    15     }
    16 }
  • 相关阅读:
    redis的持久化机制和数据同步
    树莓派开机自动运行脚本或者程序
    树莓派安装Firefox+Selenium+geckodriver
    树莓派修改启动界面
    树莓派安装使用RXTX
    树莓派开启或关闭开启自动登陆
    树莓派USB存储设备自动挂载并通过脚本实现自动拷贝,自动播放视频,脚本自动升级等功能
    树莓派镜像使用帮助
    BlueZ
    (转)MQTT 入门介绍
  • 原文地址:https://www.cnblogs.com/codeskiller/p/6598687.html
Copyright © 2011-2022 走看看