[Python] Leetcode 14. Last Common Prefix

in Algorithm on 문제풀이, Heap


Leetcode 14 Kth Last 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 “”.

longest_common_prefix_1

풀이

  • 시간복잡도: O(S). S는 모든 string의 character 개수
  • 공간복잡도: O(1)
class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        answer = ''
        for i in range(len(strs[0])):
            for string in strs:
                if i == len(string) or strs[0][i] != string[i]:
                    return answer
            answer += strs[0][i]
        return answer