← All problems

383. Ransom Note

EasyOpen on LeetCodeProblem statement

Problem Statement

383. Ransom Note

Easy


Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine and false otherwise.

Each letter in magazine can only be used once in ransomNote.

 

Example 1:

Input: ransomNote = "a", magazine = "b"
Output: false

Example 2:

Input: ransomNote = "aa", magazine = "ab"
Output: false

Example 3:

Input: ransomNote = "aa", magazine = "aab"
Output: true

 

Constraints:

C++

Source file
class Solution {
public:
    bool canConstruct(string ransomNote, string magazine) {
        map <char, int> m;
        for(char c: magazine)
            m[c]++;
        for(char c: ransomNote){
            m[c]--;
            if(m[c]<0)
                return false;
        }
        return true;
    }
};