Bulls and Cows问题及解法
来源:互联网 发布:淘宝最大股东是日本人 编辑:程序博客网 时间:2024/06/01 08:44
问题描述:
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.
示例:
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.
问题分析:
统计同一位置字母相同的个数即为bull的个数,把secret和guess其他情况下的字符剩余数目分别统计,到时取两着最小值累加起来即可,也就是cow值。
过程详见代码:
class Solution {public: string getHint(string secret, string guess) { int a = 0; int b = 0; int cache1[10]; int cache2[10]; fill_n( cache1, 10, 0 ); fill_n( cache2, 10, 0 ); for( int i = 0; i < guess.size(); ++i ) { if( guess[i] == secret[i] ) ++a; else { cache1[secret[i]-'0']++; cache2[guess[i]-'0']++; } } for( int i = 0; i < 10; ++i ) { b += min( cache1[i], cache2[i] ); } return to_string(a) + "A" + to_string(b) + "B"; }};
- Bulls and Cows问题及解法
- LeetCode299——Bulls and Cows我的解法
- [LeetCode]Bulls and Cows
- [LeetCode] Bulls and Cows
- LeetCode Bulls and Cows
- [leetcode299]Bulls and Cows
- Bulls and Cows
- leetcode | Bulls and Cows
- Bulls and Cows
- LeetCode:Bulls and Cows
- LeetCode -- Bulls and Cows
- leetcode: Bulls and Cows
- [leetcode]Bulls and Cows
- Bulls and Cows
- Bulls and Cows
- 299. Bulls and Cows
- Bulls and Cows-LeetCode
- Leetcode191: Bulls and Cows
- Axure RP 8 注册码(最新亲测可用)
- 源码阅读--进程管理
- 新能源整车控制器VCU开发过程分享
- Spring Cloud构建微服务架构:服务网关(基础)
- 多线程下载
- Bulls and Cows问题及解法
- 定义自定义表值函数(split),用于分隔字符串
- String,StringBuffer与StringBuilder的区别?
- WebView使用
- java中Object默认的基本方法
- TensorFlow 人脸识别网络与对抗网络搭建
- 使用html和jquery实现左侧可收缩导航栏
- 进口零食最受欢迎排行榜
- Exception encountered during context initialization