-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path14_Longest_Common _Prefix.py
More file actions
77 lines (57 loc) · 1.82 KB
/
14_Longest_Common _Prefix.py
File metadata and controls
77 lines (57 loc) · 1.82 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
71
72
73
74
75
76
77
"""
14. Longest Common Prefix
Easy
1166
1191
Favorite
Share
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string "".
Example 1:
Input: ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Note:
All given inputs are in lowercase letters a-z.
"""
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs:
return ""
for i in range(len(strs[0])):
#if str[0[i]] = str[1][i] and compare to all the following
for string in strs[1:]:
if i >= len(string) or string[i] != strs[0][i] :
return strs[0][:i]
# if i >= len(string) i.e. flow is shorter than flower
return strs[0]
"""
Success
Details
Runtime: 56 ms, faster than 24.24% of Python3 online submissions for Longest Common Prefix.
Memory Usage: 13 MB, less than 5.10% of Python3 online submissions for Longest Common Prefix.
"""
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
result = ""
i = 0
while True:
try:
# set function will return the unique found value
sets = set(string[i] for string in strs)
if len(sets) == 1:
result += sets.pop()
i += 1
else: break
except Exception as e:
break
return result
"""
Success
Details
Runtime: 44 ms, faster than 47.69% of Python3 online submissions for Longest Common Prefix.
Memory Usage: 13.3 MB, less than 5.10% of Python3 online submissions for Longest Common Prefix.
"""