题目描述:
python代码
class Solution():
def longestCommonPrefix(self, strs):
if not strs:
return ""
'''
for i loop的功能:
判断strs[0][i]?=strs[1][i]
for string loop的功能:
string代表strs中剩余的字符
例如strs=['flower','flow','flight']
str[1:]=strs['flow','flight']
string=['flow']
string=['flight']
'''
for i in range(len(strs[0])):
for string in strs[1:]:
if i >= len(string) or string[i] != strs[0][i]:
# 当strs[0]的长度大于其他字符,strs[0][i]!=string[i]
# 则不再循环
# 输出strs[0]中的前i位,但不包括第i位
return strs[0][:i]
return strs[0] # 该种情况有:strs=['a']
if __name__ == '__main__':
sol = Solution()
strs = ['flower', 'flow', 'flight']
print(sol.longestCommonPrefix(strs))