--

leetcode 014: longest common prefix

https://leetcode.com/problems/longest-common-prefix/

---

---

problem:

---

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.

---

---

start code (c++)

---

class Solution:
    def longestCommonPrefix(self, strs: 'List[str]') -> 'str':
        

        

---

---

solution:

我的思路：

---

class Solution:
    def longestCommonPrefix(self, strs: 'List[str]') -> 'str':
        if len(strs) == 0:
            return ''
        minSize = min([len(x) for x in strs])
        lcp = ''
        tobreak = False
        for charIdx in range(minSize):
            for strIdx in range(1, len(strs)):
                if strs[strIdx][charIdx] != strs[0][charIdx]:
                    tobreak = True
                    break
            if tobreak:
                break
            lcp += strs[0][charIdx]
        return lcp
        

---