Write a function to find the longest common prefix string amongst an array of strings.
public class Solution {
public String longestCommonPrefix(String[] strs) {
StringBuilder sb = new StringBuilder();
int len = strs.length;
if(len==0){
return sb.toString();
}
int minlenght = Integer.MAX_VALUE;
int[] length = new int[len];
for(int i = 0;i<len;i++){
length[i] = strs[i].length();
}
for(int i = 0;i<len;i++){
if(minlenght>length[i]){
minlenght = length[i];
}
}
for(int i = 0;i<minlenght;i++){
char c = strs[0].charAt(i);
int j = 0;
boolean flag = true;;
for(j = 0;j<len;j++){
if(strs[j].charAt(i)!=c){
flag = false;
break;
}
}
if(!flag){
break;
}
if(flag){
sb.append(c);
}
}
return sb.toString();
}
/**
* @param args
*/
public static void main(String[] args) {
String[] strs = {
};
System.out.println(new Solution().longestCommonPrefix(strs));
}
}