[LeetCode]#14. Longest Common Prefix

Environment: Python 3.7

Key technique: zip

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.

Analysis:

  1. Sort input str.
  2. select min and max for comparing pair.
  3. output match pair.

Solution:

class Solution:
def longestCommonPrefix(self, strs):
if not strs:
return ""

s1=min(strs)
s2=max(strs)
ans = ""
for x, y in zip(s1, s2):
if x == y: ans+=x
else: break
return ans

Submissions:

Reference:

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

Interesting in any computer science.