-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path14.py
More file actions
39 lines (31 loc) · 818 Bytes
/
14.py
File metadata and controls
39 lines (31 loc) · 818 Bytes
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
'''
14. Longest Common Prefix
Write a function to find the longest common prefix
string amongst an array of strings.
'''
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if strs == []:
return ""
if len(strs) == 1:
return strs[0]
common = strs[0]
for s in strs:
j = 0
ret = []
while j < len(s) and j < len(common):
if s[j] == common[j]:
ret.append(common[j])
else:
break
j += 1
common = "".join(ret)
return common
if __name__ == "__main__":
a = ["acb","ba"]
sol = Solution()
print(sol.longestCommonPrefix(a))