[Leetcode]Ransom Note


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

Subscribe to see which companies asked this question

class Solution {
public:
    /*algorithm  hash
       book magazine each char count
       iterate ransomNote string, decrease count array,
       check count array, if there is value < 0, false
       return true
    */
    bool canConstruct(string ransomNote, string magazine) {
        int count[26]={0};
        for(int i = 0;i < magazine.size();i++){
            count[magazine[i]-'a']++;
        }
        for(int i = 0;i < ransomNote.size();i++){
            count[ransomNote[i]-'a']--;
        }
        //check
        for(int i = 0;i < 26;i++){
            if(count[i] < 0)return false;
        }
        
        return true;
    }
};