zoukankan      html  css  js  c++  java
  • LeetCode_299. Bulls and Cows

    299. Bulls and Cows

    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.

    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.

    package leetcode.easy;
    
    public class BullsAndCows {
    	public String getHint(String secret, String guess) {
    		int bulls = 0;
    		int cows = 0;
    		int[] secretCounts = new int[10];
    		int[] guessCounts = new int[10];
    		for (int i = 0; i < guess.length(); i++) {
    			char s = secret.charAt(i);
    			char g = guess.charAt(i);
    			if (s == g) {
    				bulls++;
    			} else {
    				secretCounts[Character.getNumericValue(s)]++;
    				guessCounts[Character.getNumericValue(g)]++;
    			}
    		}
    		for (int i = 0; i < 10; i++) {
    			cows = cows + Math.min(secretCounts[i], guessCounts[i]);
    		}
    		String res = bulls + "A" + cows + "B";
    		return res;
    	}
    
    	@org.junit.Test
    	public void test() {
    		String secret1 = "1807";
    		String guess1 = "7810";
    		String secret2 = "1123";
    		String guess2 = "0111";
    		System.out.println(getHint(secret1, guess1));
    		System.out.println(getHint(secret2, guess2));
    	}
    }
    
  • 相关阅读:
    CSS 实现隐藏滚动条同时又可以滚动
    手机端自适应布局demo
    手机端自适应布局demo
    手机端自适应布局demo
    七个帮助你处理Web页面层布局的jQuery插件
    一笔画问题
    数组模拟邻接表
    邻接矩阵存图
    BFS 遍历图
    DFS 遍历图
  • 原文地址:https://www.cnblogs.com/denggelin/p/11781117.html
Copyright © 2011-2022 走看看