题目描述:
题解:
1.strnum记录输入strs中有几个单词 2.找到strs中最短字符串的长度保存在minlen中 3.maxcomstr保存最长公共子串,初始化为“” 4.从每个单词的第一个字符开始比较,是否所有的字符串对应位置的字符均相等 5.flag表示如果出现一次不相等则结束,即使之后存在相同的字符 def longestCommonPrefix(self, strs): strnum = len(strs) minlen = 1000 for i in range(strnum): if len(strs[i])<minlen: minlen = len(strs[i]) maxcomstr = "" flag = 1 for j in range(minlen): count = 0 for k in range(strnum-1): if strs[k][j]==strs[k+1][j]: count=count+1 if count==strnum-1 and flag==1: maxcomstr=maxcomstr+strs[0][j] else: flag = 0 return maxcomstr