题目:
Write a function to find the longest common prefix string amongst an array of strings.
思路:
- 暴力,从头开始两两对比,将相同部分和下一个对比,O(N^2),超时;
- 减少比较次数,先找出最短的元素,相同的部分肯定比这个长度短,两两比较时只要比较这个长度即可。
public String longestCommonPrefix(String[] strs) {
//两两对比取相同部分,相同部分再和下一个元素对比,O(N^2),超时
int n = strs.length;
String c = new String(), x, y;
if(n == 1)return strs[0];
if(n == 0)return "";
int m = strs[0].length();
for(int i = 1; i<n; i++){
m = (m < strs[i].length() ? m : strs[i].length());
}
for(int i = 1; i < n; i++){
c = "";
x = strs[i];
y = strs[i-1];
for(int j = 0; j<m; j++){
if(x.charAt(j) == y.charAt(j)){
c += y.charAt(j);
}else{
break;
}
}
strs[i] = c;
m = c.length();
if(c.isEmpty()){
break;
}
}
return c;
}