题目
代码部分一(11ms 66.23%)
class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length == 0 || strs == null) return "";
boolean flag = true;
String res = "";
int n = 0;
while(flag){
if(n >= strs[0].length()) break;
char c = strs[0].charAt(n);
for(int i = 1; i < strs.length; i++){
if(n >= strs[i].length() || strs[i].charAt(n) != c) {
flag = false;
break;
}
}
if(!flag) break;
res += c;
n++;
}
return res;
}
}
代码部分二(5ms 100%)
class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs.length == 0){
return "";
}
String prefix = strs[0];
for (int i = 1; i < strs.length; i++) {
while (strs[i].indexOf(prefix) != 0) {
prefix = prefix.substring(0, prefix.length() - 1);
if (prefix.length() == 0) {
return "";
}
}
}
return prefix;
}
}