383. Ransom Note
Problem:
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 return false.
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
思路:
Solution (C++):
ListNode* u;
Solution(ListNode* head) {
u = head;
}
/** Returns a random node's value. */
bool canConstruct(string ransomNote, string magazine) {
vector<int> vec(26, 0);
int m = ransomNote.length(), n = magazine.length();
for (int i = 0; i < n; ++i) {
++vec[magazine[i]-'a'];
}
for (int i = 0; i < m; ++i) {
if (--vec[ransomNote[i]-'a'] < 0)
return false;
}
return true;
}
性能:
Runtime: 20 ms Memory Usage: 8.8 MB
思路:
Solution (C++):
性能:
Runtime: ms Memory Usage: MB
相关链接如下:
知乎:littledy
GitHub主页:https://github.com/littledy
github.io:https://littledy.github.io/
欢迎关注个人微信公众号:小邓杂谈,扫描下方二维码即可
![](https://www.cnblogs.com/images/cnblogs_com/dysjtu1995/1468066/t_qrcode_for_gh_547d3edeac81_258.jpg)
作者:littledy
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文链接,否则保留追究法律责任的权利。