leetcode-383

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        if(ransomNote.size()>magazine.size()){
            return false;
        }

        int hash[26] = {0};
        for(int i=0;i<ransomNote.length();i++){
            hash[ransomNote[i]-'a']++;
        }

        for(int i=0;i<magazine.length();i++){
            hash[magazine[i]-'a']--;
        }

        for(int i=0;i<26;i++){
            if(hash[i]>0){
                return false;
            }
        }
        return true;
    }
};