LeetCode(383)Ransom Note
2016-08-29 20:38
369 查看
题目
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will returnfalse.
Each letter in the magazine string can only be used once in your ransom note.
Note:
You may assume that both strings contain only lowercase letters.
canConstruct("a", "b") -> false canConstruct("aa", "ab") -> false canConstruct("aa", "aab") -> true
分析
判断能否由字符串magazine中的字符构造出ransom单词。代码
#include <iostream> #include <cstdlib> #include <string> #include <vector> using namespace std; class Solution { public: bool canConstruct(string ransomNote, string magazine) { int rL = ransomNote.length(), mL = magazine.length(); vector<int> v(256, 0); for (int i = 0; i < mL; ++i) { ++v[magazine[i]]; }//for for (int i = 0; i < rL; ++i) { --v[ransomNote[i]]; if (v[ransomNote[i]] < 0) return false; }//for return true; } }; int main() { cout << Solution().canConstruct("a", "b") << endl; system("pause"); return 0; }
相关文章推荐
- leetcode383: Ransom Note
- LeetCode:383 Ransom Note
- 【LeetCode】383 Ransom Note(java)
- LeetCode:Ransom Note_383
- Leetcode 383 Ransom Note
- 【python】【leetcode】【算法题目383—Ransom Note】
- leetcode 383 Ransom Note
- Java [Leetcode 383]Ransom Note
- 【LeetCode-383】Ransom Note(C++)
- leetcode-383-Ransom Note
- leetcode_c++: Ransom Note(383)
- LeetCode[383] Ransom Note
- Leetcode 383 Ransom Note
- LeetCode 383:Ransom Note
- Leetcode:383.Ransom Note(统计每个字符串每个字母的个数)
- LeetCode 383:Ransom Note (c++)
- leetcode383[easy]--- Ransom Note
- LeetCode 383 Ransom Note
- [LeetCode-383]Ransom Note(java)
- 【LeetCode】383 Ransom Note(java)