class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
length = len(strs)
if length == 0:
return ""
prefix = strs[0] # 先将strs中的第一个字符串作为prefix
for i in range(1, length):
if prefix == "":
break
current_str = strs[i]
min_len = min(len(prefix), len(current_str))
j = 0
# 使用指针,来标记公共前缀的最后一个字符
while j < min_len and prefix[j] == current_str[j]:
j += 1
prefix = prefix[:j] # 范围是[0,j), 可省略“0”
return prefix