day18-猜数字游戏

最新推荐文章于 2024-09-20 15:28:15 发布

冉卿

最新推荐文章于 2024-09-20 15:28:15 发布

阅读量2.1k

点赞数

文章标签： leetcode 动态规划算法

本文链接：https://blog.csdn.net/weixin_54209187/article/details/122369741

版权

题目

力扣t

题解

class Solution {
    public String getHint(String secret, String guess) {
        int countA = 0, countB = 0, length = secret.length();
        //先判断公牛
        for (int i = 0; i < length; i++) {
            if (secret.charAt(i) == guess.charAt(i)) {
                countA++;
                //已经用掉了改变下该位置的值
                secret = secret.substring(0, i) + "a" + secret.substring(i + 1);
                guess = guess.substring(0, i) + "b" + guess.substring(i + 1);
            }
        }
        //其次判断奶牛
        for (int i = 0; i < length; i++) {
            if (secret.contains(String.valueOf(guess.charAt(i)))) {
                countB++;
                int index = secret.indexOf(String.valueOf(guess.charAt(i)));
                secret = secret.substring(0, index) + "a" + secret.substring(index + 1);
            }
        }
        return countA + "A" + countB + "B";
    }
}