-
Notifications
You must be signed in to change notification settings - Fork 607
/
14.py
50 lines (38 loc) · 1.21 KB
/
14.py
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
'''
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(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
def prefix(strs, index):
check_prefix = strs[0][:index]
for index in range(1, len(strs)):
if not strs[index].startswith(check_prefix):
return False
return True
if not strs:
return ""
minLength = float('inf')
for string in strs:
minLength = min(minLength, len(string))
low, high = 0, minLength
while low <= high:
mid = (low+high)/2
if (prefix(strs, mid)):
low = mid + 1
else:
high = mid - 1
return strs[0][:(low+high)/2]