383. Ransom Note
2016-08-21 11:21
169 查看
问题描述
![](https://images2015.cnblogs.com/blog/681089/201608/681089-20160821111929542-1164163608.png)
解决方案
class Solution { public: bool canConstruct(string ransomNote, string magazine) { int a[26]={0}; int b[26]={0}; for(int i=0;i<ransomNote.size();++i) { a[ransomNote[i]-'a']++; } for(int i=0;i<magazine.size();++i) { b[magazine[i]-'a']++; } for(int i=0;i<26;++i) { if(a[i]>b[i]) return false; } return true; } };
相关文章推荐
- 383. Ransom Note
- 383. Ransom Note
- LeetCode之路:383. Ransom Note
- 383. Ransom Note
- leetcode 383. Ransom Note
- 383. Ransom Note
- LeetCode—383. Ransom Note
- Leetcode 383. Ransom Note
- 383. Ransom Note
- LeetCode 383. Ransom Note
- leetcode 383. Ransom Note
- 383. Ransom Note
- 383. Ransom Note
- 小白笔记--------------leetcode(383. Ransom Note)
- 383. Ransom Note
- leetcode-383. Ransom Note
- LeetCode-383. Ransom Note
- LeetCode OJ-383. Ransom Note
- leetcode 383. Ransom Note
- LeetCode383. Ransom Note