Leetcode 383. Ransom Note (Easy) (cpp)

Leetcode 383. Ransom Note (Easy) (cpp)

Tag: String

Difficulty: Easy

/*

383. Ransom Note (Easy)


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) {
for (auto cha_r : ransomNote) {
auto cha_m = magazine.find(cha_r);
if (cha_m == string::npos) return false;
magazine.erase(cha_m, 1);
}
return true;
}
};