题目链接

https://leetcode.cn/problems/ransom-note/description/

代码

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int record[26] = {0};
        if(ransomNote.size() > magazine.size()) return false;
        for(int i = 0; i < magazine.size(); i++) record[magazine[i] - 'a']++;
        for(int i = 0; i < ransomNote.size(); i++){
            record[ransomNote[i] - 'a']--;
            if(record[ransomNote[i] -'a'] < 0) return false;
        }
        return true;

    }
};