문돌이 존버/프로그래밍 스터디
2021. 9. 30.
(leetcode 문제 풀이) 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: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: - 1 str: if len(strs) == 0: return return self.longe..