-
Notifications
You must be signed in to change notification settings - Fork 0
/
longest_common_prefix_14.py
54 lines (37 loc) · 1.46 KB
/
longest_common_prefix_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
51
52
53
54
"""
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: strs = ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Constraints:
1 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i] consists of only lowercase English letters.
"""
from typing import List
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs:
return ""
min_len_word = min(len(word) for word in strs)
res = ''
for i in range(min_len_word):
current_char = strs[0][i]
for word in strs:
if word[i] != current_char:
return res
res += current_char
return res
if __name__ == '__main__':
solution = Solution()
assert solution.longestCommonPrefix(["flower", "flow", "flight"]) == "fl", "Error on test case 1"
assert solution.longestCommonPrefix(["dog", "racecar", "car"]) == "", "Error on test case 2"
assert solution.longestCommonPrefix(["interspecies", "interstellar", "interstate"]) == "inters", "Error on test case 3"
assert solution.longestCommonPrefix([""]) == "", "Error on test case 4"
assert solution.longestCommonPrefix(["a"]) == "a", "Error on test case 5"
print("All tests passed successfully.")