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

    Be careful, when calculate B, you should exclude A's cases

     1 class Solution {
     2     public String getHint(String secret, String guess) {
     3         int[] countA = new int[10];
     4         int[] countB = new int[10];
     5         int A = 0, B = 0;
     6         for (int i = 0; i < secret.length(); i ++) {
     7             if (secret.charAt(i) == guess.charAt(i)) A ++;
     8             else {
     9                 countA[secret.charAt(i) - '0'] ++;
    10                 countB[guess.charAt(i) - '0'] ++;
    11             }
    12         }
    13         
    14         for (int j = 0; j < 10; j ++) {
    15             B += Math.min(countA[j], countB[j]);
    16         }
    17         
    18         return A + "A" + B + "B";
    19     }
    20 }
  • 相关阅读:
    创建smartfroms页格式
    常用TCODE
    CALL transaction 的用法-传内表
    POPUP_TO_CONFIRM的使用方法
    PARAMETERS 指令
    常用弹出对话框函数
    alv界面透视功能
    解决org.apache.ibatis.binding.BindingException: Invalid bound statement (not found)问题
    Error:java: Annotation processing is not supported for module cycles.
    pom配置进行版本号统一管理
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/5084546.html
Copyright © 2011-2022 走看看