It has been 1141 days since the last update, the content of the article may be outdated.

此篇文章為我的解題紀錄，程式碼或許並不是很完善

Leetcode - 14. Longest Common Prefix

解題思路

一開始先用字串長度將陣列排序好，確保第一個字串的長度是最短的
用str[0]內的每個字元下去跑，如果他存在在strs陣列裡的每個字，則一直跑到不相等為止

我滴程式碼

python
1
2
3
4
5
6
7
8
9
10
11
class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        strs.sort(key=len)
        pre = ""

        for i in range(len(strs[0])):
            for word in strs:
                if strs[0][i] != word[i]:
                    return pre
            pre = pre + strs[0][i]               
        return pre