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.
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:
- You may assume that both strings contain only lowercase letters.
Python3 Solution:
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
dic = defaultdict(int)
for ch in ransomNote:
dic[ch] -= 1
for ch in magazine:
if dic and ch in dic:
dic[ch] += 1
if dic[ch] > -1:
dic.pop(ch)
return not dic