美文网首页
383. Ransom Note

383. Ransom Note

作者: SilentDawn | 来源:发表于2018-10-13 10:02 被阅读0次

    Problem

    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.
    Note:
    You may assume that both strings contain only lowercase letters.

    Example

    canConstruct("a", "b") -> false
    canConstruct("aa", "ab") -> false
    canConstruct("aa", "aab") -> true
    

    Code

    static int var = [](){
        std::ios::sync_with_stdio(false);
        cin.tie(NULL);
        return 0;
    }();
    class Solution {
    public:
        bool canConstruct(string ransomNote, string magazine) {
            long table[256] = {0};
            for(int i=0;i<magazine.size();i++){
                table[magazine[i]]++;
            }
            for(int i=0;i<ransomNote.size();i++){
                if((--table[ransomNote[i]])<0)
                    return false;
            }
            return true;
        }
    };
    

    Result

    383. Ransom Note.png

    相关文章

      网友评论

          本文标题:383. Ransom Note

          本文链接:https://www.haomeiwen.com/subject/egtoaftx.html