-
Notifications
You must be signed in to change notification settings - Fork 1
/
383.RansomNote.py
executable file
·61 lines (45 loc) · 1.68 KB
/
383.RansomNote.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun May 3 11:45:58 2020
@author: nenad
"""
"""
Problem URL: https://leetcode.com/problems/ransom-note/
Problem description:
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.
Note:
You may assume that both strings contain only lowercase letters.
canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true
"""
# Time: O(len(ransomNote) + len(magazine)), space: O(len(magazine))
from collections import Counter
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
counterMagazineLetters = Counter()
for letter in magazine:
counterMagazineLetters[letter] += 1
for letter in ransomNote:
val = counterMagazineLetters.get(letter, 0)
if val <= 0:
return False
counterMagazineLetters[letter] -= 1
return True
def canConstruct(self, ransomNote, magazine):
ransomNoteCounter = Counter(ransomNote)
magazineCounter = Counter(magazine)
for letter in ransomNoteCounter:
if ransomNoteCounter[letter] > magazineCounter.get(letter, 0):
return False
return True
sol = Solution()
# Test 1
print(sol.canConstruct("a", "b"))
# Test 2
print(sol.canConstruct("aa", "ab"))
# Test 3
print(sol.canConstruct("aa", "aab"))