-
Notifications
You must be signed in to change notification settings - Fork 0
/
Ransome Note.cpp
36 lines (32 loc) · 916 Bytes
/
Ransome Note.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
/*
Ransom Note
Solution
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
*/
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
map<int,int> m;
for(char x:magazine)
{
m[x] = m[x]+1;
}
for(char x:ransomNote)
{
if(m[x]>0)
{
m[x] = m[x] - 1;
}else
{
return 0;
}
}
return 1;
}
};