-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path819_most_common_word.py
More file actions
48 lines (44 loc) · 1.94 KB
/
819_most_common_word.py
File metadata and controls
48 lines (44 loc) · 1.94 KB
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
class Solution:
def mostCommonWord(self, paragraph: str, banned: List[str]) -> str:
lower_paragraph = paragraph.lower()
lower_paragraph = lower_paragraph.replace('!', ' ')
lower_paragraph = lower_paragraph.replace('?', ' ')
lower_paragraph = lower_paragraph.replace("'", ' ')
lower_paragraph = lower_paragraph.replace(',', ' ')
lower_paragraph = lower_paragraph.replace(';', ' ')
lower_paragraph = lower_paragraph.replace('.', ' ')
words = lower_paragraph.split()
word_times = {}
for word in words:
if word not in word_times:
word_times[word] = 1
else:
word_times[word] += 1
banned_set = set(banned)
for banned_word in banned_set:
if banned_word in word_times:
word_times.pop(banned_word)
max_times = 0
ans = []
for key, value in word_times.items():
if value > max_times:
ans = key
max_times = value
else:
pass
return ans
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''