【Hash】383. Ransom Note

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        unordered_map<char,int> table;
        for(int i=0;i<magazine.size();i++)
        {
            if(table.find(magazine[i])==table.end())
                table[magazine[i]]=1;
            else
                table[magazine[i]]++;
        }
        
        for(int i = 0;i<ransomNote.size();i++)
        {
            if(table.find(ransomNote[i])!=table.end()&&table[ransomNote[i]]>0)
            {
                table[ransomNote[i]]--;
                continue;
            }
            else
                return 0;
        }
        return 1;
    }
};