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.

Note:

All given inputs are in lowercase letters a-z.

My solution:

class Solution:
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """

        if not strs:
            return ""

        shortest = min(strs, key=len)
        strs.remove(shortest)

        for i, ch in enumerate(shortest):
            for compare in strs:
                if ch != compare[i]:
                    return shortest[:i]

        return shortest

Check out shortest List(str).

And then, let's find out prefix other List(str)