LeetCode OJ - Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

my answer:

public class Solution {
public static String longestCommonPrefix(String[] strs) {

String prefix=strs[0];
if(prefix.length()==0)
return "";
int len=0;
for(int i=1;i<strs.length;i++){
if(prefix.length()==0 || strs[i].length() == 0)
return "";
len=(prefix.length()<strs[i].length())?prefix.length():strs[i].length();

int j=0;
for(j=0;j<len;j++) {
if(prefix.charAt(j)!=strs[i].charAt(j))
break;
}
prefix=prefix.substring(0,j);
}
return prefix;
}

public static void main(String[] args){
String str = longestCommonPrefix(new String[]{""});
System.out.println(str);
}
}

Runtime: 5
ms

呃呃呃，不知道有什么更好的办法没有了，要注意各种另类状况就好...