-
Notifications
You must be signed in to change notification settings - Fork 0
/
14.py
36 lines (27 loc) · 947 Bytes
/
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
# 14. Longest Common Prefix
# 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.
from typing import List
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if len(strs) == 0:
return ""
answer = ""
for i in range(len(strs[0])):
for s in strs:
if len(s) <= i or s[i] != strs[0][i]:
return answer
answer = answer + strs[0][i]
return answer
if __name__ == '__main__':
from util import Test
t = Test(Solution().longestCommonPrefix)
t.equal("fl", ["flower", "flow", "flight"])
t.equal("", ["dog", "racecar", "car"])