299. Bulls and Cows

栏目: Java · 发布时间: 5年前

内容简介: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 sec

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.

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.

Please note that both secret number and friend's guess may contain duplicate digits.

Example 1:

Input: secret = "1807", guess = "7810"
Output: "1A3B"
Explanation: 1 bull and 3 cows. The bull is 8, the cows are 0, 1 and 7.

Example 2:

Input: secret = "1123", guess = "0111"
Output: "1A1B"
Explanation: The 1st 1 in friend's guess is a bull, the 2nd or 3rd 1 is a cow.

Note: You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.

难度:medium

题目:你在和朋友玩bulls和cows游戏:你写下一个数字让你的朋友去猜。每次你的朋友猜一个数字,你给出提示有多少个数字值与位置相同(叫bulls),有多少个数字值相同但位置不相同(叫cows)。你的朋友持续猜测直到获取正确的数字。

写一方法根据你朋友的猜测来返回提示,A表示bulls B表示cows.

思路:先找出所有精确匹配,然后单独统计值相同位置不相同的字符。

Runtime: 9 ms, faster than 21.94% of Java online submissions for Bulls and Cows.

Memory Usage: 35.6 MB, less than 78.72% of Java online submissions for Bulls and Cows.

class Solution {
    public String getHint(String secret, String guess) {
        int bulls = 0, cows = 0;
        int[] secretTable = new int[256];
        int[] guessTable = new int[256];
        for (int i = 0; i < secret.length(); i++) {
            if (secret.charAt(i) == guess.charAt(i)) {
                bulls++;
            } else {
                secretTable[secret.charAt(i)]++;
                guessTable[guess.charAt(i)]++;
            }
        }
        
        for (int i = 0; i < 256; i++) {
            cows += Math.min(secretTable[i], guessTable[i]);
        }
        
        return String.format("%dA%dB", bulls, cows);
    }
}

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持 码农网

查看所有标签

猜你喜欢:

本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们

有的放矢

有的放矢

Nathan Furr、Paul Ahlstrom / 七印部落 / 华中科技大学出版社 / 2014-4-20 / 38.00元

创业需要大笔资金吗?自信的人适合创业吗?好点子究竟来自哪里?《有的放矢:NISI创业指南》的两位作者拥有多年创业与投资经验,收集了大量的一手案例和资料,提出有的放矢创业流程,帮助创业者规避创业风险,提高创业成功率。一起来看看 《有的放矢》 这本书的介绍吧!

CSS 压缩/解压工具
CSS 压缩/解压工具

在线压缩/解压 CSS 代码

JSON 在线解析
JSON 在线解析

在线 JSON 格式化工具

XML、JSON 在线转换
XML、JSON 在线转换

在线XML、JSON转换工具