-
Notifications
You must be signed in to change notification settings - Fork 0
/
ransom_note.py
37 lines (28 loc) · 999 Bytes
/
ransom_note.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
'''
Problem:
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
'''
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
distinct_char = set(list(ransomNote))
check_flag = "Yes"
for i in distinct_char:
if magazine.count(i) < ransomNote.count(i):
check_flag = "No"
break
else:
continue
if check_flag == "No":
return False
else:
return True