[LeetCode] 383 | Ransom Note | Python

---

문제 링크: https://leetcode.com/problems/ransom-note/

Ransom Note - LeetCode

---

문제

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.

---

조건

• 1 <= ransomNote.length, magazine.length <= $10^5$
• ransomNote and magazine consist of lowercase English letters.

---

내 풀이

magazine에서 ransomNote 안에 있는 한 글자씩 제거해보면서 문제의 조건에 해당하는지 확인한다.

---

코드

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        for r in ransomNote:
            if r in magazine:
                magazine = magazine.replace(r, '', 1)
            else:
                return False
            
        return True