-
Notifications
You must be signed in to change notification settings - Fork 0
/
canConstruct.py
37 lines (26 loc) · 963 Bytes
/
canConstruct.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
# https://leetcode.com/problems/ransom-note/description/
# 383. 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
from collections import Counter as c
def canConstruct(ransomNote, magazine):
"""
:type ransomNote: str
:type magazine: str
:rtype: bool
"""
d1, d2 = c(ransomNote), c(magazine)
for k, v in d1.items():
if v > d2[k]:
return False
return True
assert canConstruct('a', 'b') == False
assert canConstruct('aa', 'ab') == False
assert canConstruct('dba', 'aabcd') == True