-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2942. FindWordsContainingCharacter.py
More file actions
55 lines (46 loc) · 1.64 KB
/
2942. FindWordsContainingCharacter.py
File metadata and controls
55 lines (46 loc) · 1.64 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
#
# @PROBLEM : 2942. Find Words Containing Character
# @LEVEL : EASY
# @STATUS : SOLVED !
# @COMPLEXITY : O(n)
# @SOLVED BY : PLIPUS TELAUMBANUA <www.plipustel.com>
# @LEETCODE : https://leetcode.com/u/plipustel/
# @DATE : SATURDAY, JUN 22 2024
#
# @PROBLEM SOURCE: https://leetcode.com/problems/find-words-containing-character/description/
# @PROBLEM DESC :
# You are given a 0-indexed array of strings words and a character x.
# Return an array of indices representing the words that contain the character x.
# Note that the returned array may be in any order.
# Example 1:
# Input: words = ["leet","code"], x = "e"
# Output: [0,1]
# Explanation: "e" occurs in both words: "leet", and "code". Hence, we return indices 0 and 1.
# Example 2:
# Input: words = ["abc","bcd","aaaa","cbc"], x = "a"
# Output: [0,2]
# Explanation: "a" occurs in "abc", and "aaaa". Hence, we return indices 0 and 2.
# Example 3:
# Input: words = ["abc","bcd","aaaa","cbc"], x = "z"
# Output: []
# Explanation: "z" does not occur in any of the words. Hence, we return an empty array.
# Constraints:
# 1 <= words.length <= 50
# 1 <= words[i].length <= 50
# x is a lowercase English letter.
# words[i] consists only of lowercase English letters.
class Solution(object):
def findWordsContaining(self, words, x):
"""
:type nums: List[int]
:type k: int
:rtype: int
"""
indicies = []
for i, v in enumerate(words):
if x in v:
indicies.append(i)
return indicies
str = ["abc","bcd","aaaa","cbc"]
sol = Solution()
print(sol.findWordsContaining(str, 'a'))