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.
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
counter = Counter(magazine)
for c in ransomNote:
if counter[c] <= 0:
return False
counter[c] -= 1
return True
class Solution {
public boolean canConstruct(String ransomNote, String magazine) {
int[] counter = new int[26];
for (char c : magazine.toCharArray()) {
++counter[c - 'a'];
}
for (char c : ransomNote.toCharArray()) {
if (counter[c - 'a'] <= 0) {
return false;
}
--counter[c - 'a'];
}
return true;
}
}
function canConstruct(ransomNote: string, magazine: string): boolean {
let counter = new Array(26).fill(0);
let base = "a".charCodeAt(0);
for (let s of magazine) {
++counter[s.charCodeAt(0) - base];
}
for (let s of ransomNote) {
let idx = s.charCodeAt(0) - base;
if (counter[idx] == 0) return false;
--counter[idx];
}
return true;
}
class Solution {
public:
bool canConstruct(string ransomNote, string magazine) {
vector<int> counter(26);
for (char c : magazine) ++counter[c - 'a'];
for (char c : ransomNote)
{
if (counter[c - 'a'] <= 0) return false;
--counter[c - 'a'];
}
return true;
}
};
func canConstruct(ransomNote string, magazine string) bool {
rc := make([]int, 26)
for _, b := range ransomNote {
rc[b-'a']++
}
mc := make([]int, 26)
for _, b := range magazine {
mc[b-'a']++
}
for i := 0; i < 26; i++ {
if rc[i] > mc[i] {
return false
}
}
return true
}