2021-06-13 19:24 清华大学 iOS开发
关注
D1-Longest Common Prefix
---
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs:
return ""
short_str = min(strs,key=len)
print(short_str)
for i, char in enumerate(short_str):
for other in strs:
if other[i] != char:
return short_str[:i]
return short_str
#print(Solution().longestCommonPrefix(['abcs','abds']))
----
---
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if not strs:
return ""
short_str = min(strs,key=len)
print(short_str)
for i, char in enumerate(short_str):
for other in strs:
if other[i] != char:
return short_str[:i]
return short_str
#print(Solution().longestCommonPrefix(['abcs','abds']))
----
全部评论
相关推荐
点赞 评论 收藏
分享
2025-12-26 10:52
河北传媒学院 Java 
点赞 评论 收藏
分享
2025-12-30 10:45
安徽理工大学 Java 点赞 评论 收藏
分享