[14] Longest Common Prefix | Leetcode Easy

問題の説明

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 "".

結果の例

Input: strs = ["flower","flow","flight"]
Output: "fl"

Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Pythonコード

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        ret = ""
        if len(str)==0 : return ret
        strs.sort(key = lambda x : len(x))  #문자열 길이가 짧은 순으로 정렬
        minLen = len(strs[0])
        #구하고자하는 longest common prefix의 최대 길이의 한계치는 minLen이 된다.
        for i in range(minLen):
            s = strs[0][i]
            flag = True
            for v in strs:
                if s != v[i] :
                    flag = False
                    break;
            if flag :   #각 자리의 문자가 같다면 ret 뒤에 추가한다.
               ret = ret + s 
            else :
                break   #다르다면 종료
                
        return ret

他者コード

class Solution:
    def longestCommonPrefix(self, strs):
        prefix=""
        if len(strs)==0: return prefix
        for i in range(len(min(strs,key=len))):
            c=strs[0][i]
            if all(a[i]==c for a in strs):
                prefix+=c
            else:
                break
        return prefix

内蔵関数any()、all()

例

cur = 3
nums = [1,3,10,0]
if any(cur < n for n in nums):
	print("3보다 큰 숫자가 존재합니다.")