forked from someshgkale123/LeetCode-Easy
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Find Words That Can Be Formed by Characters
43 lines (35 loc) · 1.22 KB
/
Find Words That Can Be Formed by Characters
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
Problem Statement:
You are given an array of strings words and a string chars.
A string is good if it can be formed by characters from chars (each character can only be used once).
Return the sum of lengths of all good strings in words.
Example 1:
Input: words = ["cat","bt","hat","tree"], chars = "atach"
Output: 6
Explanation:
The strings that can be formed are "cat" and "hat" so the answer is 3 + 3 = 6.
Example 2:
Input: words = ["hello","world","leetcode"], chars = "welldonehoneyr"
Output: 10
Explanation:
The strings that can be formed are "hello" and "world" so the answer is 5 + 5 = 10.
Solution:
class Solution:
def countCharacters(self, words: List[str], chars: str) -> int:
if not chars:
return 0
ans=0
for word in words:
original=collections.Counter(chars)
flag=True
for letter in word:
if letter in original:
flag=True
original[letter]-=1
if original[letter]==0:
del original[letter]
else:
flag=False
break
if flag:
ans+=len(word)
return ans