383. 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.

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int buffer1[128] = {0};
        int buffer2[128] = {0};
        for(int i=0;i<ransomNote.size();i++) buffer1[ransomNote[i]] += 1;
        for(int i=0;i<magazine.size();i++) buffer2[magazine[i]] += 1;
        for(int i=0;i<128;i++){
            if(buffer1[i] > buffer2[i]) return false;
        }
        return true;
    }
};
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容