https://leetcode-cn.com/problems/longest-common-prefix/description/
1.算出字符串数组的最短字符串长度
2.判断所有字符串对应的下标的字符是否相等,不相等直接退出二重循环
class Solution {
public String longestCommonPrefix(String[] strs) {
String s = "";
int mi = Integer.MAX_VALUE;
for(int i = 0;i < strs.length;i++)
mi = Math.min(mi,strs[i].length());
if(mi == Integer.MAX_VALUE)
mi = -1;
loop:
for(int i = 0;i < mi;i++) {
for(int j = 1;j < strs.length;j++) {
if(strs[j].charAt(i) != strs[0].charAt(i))
break loop;
}
s += strs[0].charAt(i);
}
return s;
}
}