LeetCode 299. Bulls and Cows
来源:互联网 发布:网络招聘兼职 编辑:程序博客网 时间:2024/04/30 09:22
描述
给出两个字符串A和B,判断A、B有多少个字符位置与字符都相同,有多少个字符在B和A中都出现了,但是位置不同
解决
用map去存A中字符(位置与值不同),用vector存B中独有的字符,最后遍历vector中的字符即可
class Solution {public: string getHint(string secret, string guess) { int length1 = secret.size(); int length2 = guess.size(); int cnt1 = 0, cnt2 = 0; map<char, int> pos; map<char, int> has1; vector<char> has2; cout << length1 << endl; for (int i = 0; i < length1; ++i) { if (secret[i] == guess[i]) { pos[i] = 1; ++cnt1; } else { ++has1[secret[i]]; has2.push_back(guess[i]); } } for (auto it : has2) { if (has1[it] >= 1) { ++cnt2; --has1[it]; } } return to_string(cnt1) + "A" + to_string(cnt2) + "B"; }};
0 0
- [leetcode] 299. Bulls and Cows
- LeetCode || 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- Leetcode 299. Bulls and Cows
- LeetCode.299.Bulls and Cows
- LeetCode--299. Bulls and Cows
- 【LeetCode】299. Bulls and Cows
- [leetcode] 299. Bulls and Cows
- LeetCode *** 299. Bulls and Cows
- leetcode 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- LeetCode-299.Bulls and Cows
- Leetcode 299. Bulls and Cows
- 299.[leetcode]Bulls and Cows
- leetcode 299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- 【leetcode】299. Bulls and Cows
- LeetCode 299. Bulls and Cows
- 使用gulp实现前端自动化
- Android点击EditText外面隐藏输入法
- Json DFS parse(PG)
- STM32F407 - 低功耗模式之待机唤醒
- extjs 下拉框增加空选项
- LeetCode 299. Bulls and Cows
- jmeter学习记录(二):简单web测试流程
- Google官方网络框架-Volley的使用解析Json以及加载网络图片方法
- Dijkstra求最短路径
- 水环境监测系统
- GIT的操作
- PHP之六_MySQL数据库设计
- linux上安装apache以及httpd.conf基本配置
- mvn常用命令