LEETCODEEasy

Ransom Note

풀이일 2025 · 03 · 27기록 14 ms · 60.7 MB원문 leetcode ↗

Hash TableStringCounting

문제

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:

1 <= ransomNote.length, magazine.length <= 10⁵
ransomNote and magazine consist of lowercase English letters.

풀이 TypeScript

function canConstruct(ransomNote: string, magazine: string): boolean {
  const magazineMap = new Map<string, number>();
  magazine.split('').forEach(letter => magazineMap.set(letter, (magazineMap.get(letter) || 0) + 1))

  for(let i = 0; i < ransomNote.length; i++) {
    const letter = ransomNote[i];
    if(!magazineMap.get(letter)) return false
    magazineMap.set(letter, magazineMap.get(letter)! - 1);
  }
  return true
}

복사됨