-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcountCharacters.py
More file actions
70 lines (50 loc) · 2.11 KB
/
countCharacters.py
File metadata and controls
70 lines (50 loc) · 2.11 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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
# -*- encoding: utf-8 -*-
'''
@project : LeetCode
@File : countCharacters.py
@Contact : 9824373@qq.com
@Desc :
给你一份『词汇表』(字符串数组) 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。
提示:
1 <= words.length <= 1000
1 <= words[i].length, chars.length <= 100
所有字符串中都仅包含小写英文字母
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters
@Modify Time @Author @Version @Desciption
------------ ------- -------- -----------
2020-03-17 zhan 1.0 None
'''
from typing import List
from collections import Counter
class Solution:
def countCharacters(self, words: List[str], chars: str) -> int:
counter = Counter(chars)
ans = 0
for word in words:
curCount = Counter(word)
for k in curCount:
if counter[k] < curCount[k]:
break
else: ans += len(word)
return ans
if __name__ == '__main__':
words = ["hello", "world", "leetcode"]
chars = "welldonehoneyr"
ans = Solution().countCharacters(words,chars)
print(ans)