-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path1160.py
More file actions
41 lines (34 loc) · 1.36 KB
/
1160.py
File metadata and controls
41 lines (34 loc) · 1.36 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
"""给你一份『词汇表』(字符串数组) words 和一张『字母表』(字符串) chars。
假如你可以用 chars 中的『字母』(字符)拼写出 words 中的某个『单词』(字符串),那么我们就认为你掌握了这个单词。
注意:每次拼写时,chars 中的每个字母都只能用一次。
返回词汇表 words 中你掌握的所有单词的 长度之和。
示例 1:
输入:words = ["cat","bt","hat","tree"], chars = "atach"
输出:6
解释:
可以形成字符串 "cat" 和 "hat",所以答案是 3 + 3 = 6。
示例 2:
输入:words = ["hello","world","leetcode"], chars = "welldonehoneyr"
输出:10
解释:
可以形成字符串 "hello" 和 "world",所以答案是 5 + 5 = 10。
"""
class Solution:
def countCharacters(self, words, chars):
"""
:param words: list[str]
:param chars: str
:return: int
"""
t=0
for i in range(len(words)):
for j in range(len(words[i])):
if words[i].count(words[i][j]) > chars.count(words[i][j]):
break
if j==len(words[i])-1:
t+=j+1
return t
s=Solution()
print(s.countCharacters(words = ["cat","bt","hat","tree"], chars = "atach"))
print(s.countCharacters(words = ["hello","world","leetcode"], chars = "welldonehoneyr"))