-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path290.py
More file actions
49 lines (38 loc) · 1.21 KB
/
290.py
File metadata and controls
49 lines (38 loc) · 1.21 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
'''
290. Word Pattern
Given a pattern and a string str, find if str follows the same pattern.
Here follow means a full match, such that there is a bijection between a letter
in pattern and a non-empty word in str.
Examples:
pattern = "abba", str = "dog cat cat dog" should return true.
pattern = "abba", str = "dog cat cat fish" should return false.
pattern = "aaaa", str = "dog cat cat dog" should return false.
pattern = "abba", str = "dog dog dog dog" should return false.
Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase
letters separated by a single space.
'''
class Solution(object):
def wordPattern(self, pattern, str):
"""
:type pattern: str
:type str: str
:rtype: bool
"""
lstr = str.split(" ")
if len(pattern) != len(lstr):
return False
retP = []
retS = []
for p in pattern:
retP.append(pattern.find(p))
for s in lstr:
retS.append(lstr.index(s))
# print(retP)
# print(retS)
return (retP == retS)
if __name__ == "__main__":
pattern = "abba"
s = "dog dog dog dog"
sol = Solution()
print(sol.wordPattern(pattern, s))