Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.
例如：[“leets”, “leetcode”, “leet”, “leed”], LCP为“lee”.

思路：
垂直搜索，从头开始比较每个字符串相同位置的字符， 若相同，则继续向后比较， 否则返回任一字符串从头到该位置的字符区间；

class Solution(object):    def longestCommonPrefix(self, strs):        """        :type strs: List[str]        :rtype: str        """        if len(strs) == 0:            return ""        if len(strs) == 1:            return strs[0]        for i, char in enumerate(strs[0]):            for j in range(1, len(strs)):                if (i == len(strs[j])) or strs[j][i] != char:                    return strs[0][:i]        return strs[0]