leetcode-383-Ransom Note

问题

题目：[leetcode-383]

思路

哈希表记录一下。

代码

class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        int hash[128];
        std::memset( hash, 0, sizeof(hash) );
        int sz_magazine = magazine.size();
        int sz_ransomNote = ransomNote.size();

        for( int i = 0; i < sz_magazine; ++i ){
            ++hash[magazine[i]];
        }
        for( int i = 0; i < sz_ransomNote; ++i ){
            if( !hash[ ransomNote[i] ] ) return false;
            else --hash[ ransomNote[i] ];
        }

        return true;
    }
};