【朱迪的LeetCode刷题笔记】14. Longest Common Prefix #Easy #Python

Judie

1. Write a function to find the longest common prefix string amongst an array of strings.
   
2. 
   
3. If there is no common prefix, return an empty string "".
   
4. 
   
5. 
   
6. Example 1:
   
7. 
   
8. Input: strs = ["flower","flow","flight"]
   
9. Output: "fl"
   
10. 
    
11. Example 2:
    
12. 
    
13. Input: strs = ["dog","racecar","car"]
    
14. Output: ""
    
15. Explanation: There is no common prefix among the input strings.
    
16. 
    
17. 
    
18. Constraints:
    
19. 
    
20. 1 <= strs.length <= 200
    
21. 0 <= strs[i].length <= 200
    
22. strs[i] consists of only lower-case English letters.

复制代码

Python

1. class Solution:
   
2.     def longestCommonPrefix(self, strs: List[str]) -> str:
   
3.         retval = strs[0]
   
4.         for x in strs:
   
5.             while retval:
   
6.                 if x.startswith(retval):
   
7.                     break
   
8.                 else:
   
9.                     i = len(retval) - 1
   
10.                     retval = retval[:i]
    
11.         return retval

复制代码