LeetCode 383. Ransom Note
2016-09-13 20:18
375 查看
描述
判断序列ransomNote可否由magazine中的字符构成解决
记录ransomNote的字符出现次数,再遍历magazine中的字符,最后再一次遍历判断。class Solution { public: bool canConstruct(string ransomNote, string magazine) { int arr[27] = {0}; int i = 0; while (ransomNote[i]){ ++arr[ransomNote[i++] - 'a']; } i = 0; while (magazine[i]){ --arr[magazine[i++] - 'a']; } i = 0; while (ransomNote[i]){ if (arr[ransomNote[i] - 'a'] > 0){ return false; } ++i; } return true; } };
相关文章推荐
- [LeetCode]383. Ransom Note
- 小白笔记--------------leetcode(383. Ransom Note)
- LeetCode_383. Ransom Note
- leetcode 383. Ransom Note HashMap 统计字符 + HashMap
- 【leetcode】383. Ransom Note
- leetcode - 383. Ransom Note
- [LeetCode] 383. Ransom Note
- Leetcode - String - 383. Ransom Note(水题)
- LeetCode 383. Ransom Note
- LeetCode-383. Ransom Note
- 【LeetCode】 383. Ransom Note
- [LeetCode]383. Ransom Note(赎金票据)
- leetcode-383. Ransom Note
- leetcode 383. Ransom Note
- Leetcode 383. Ransom Note (Easy) (cpp)
- [LeetCode]--383. Ransom Note
- LeetCode383. Ransom Note优雅解法(线性时间复杂度)
- LeetCode 383. Ransom Note 自己的解法
- leetcode 383. Ransom Note
- leetcode 383. Ransom Note