Write a function to find the longest common prefix string amongst an array of strings.
public class Solution {
public String longestCommonPrefix(String[] strs) {
if(strs == null || strs.length == 0) return "";
String longest = strs[0];
for(int i = 1; i < strs.length; i++){
int j = 0;
while(j < longest.length() && j < strs[i].length() && longest.charAt(j) == strs[i].charAt(j)){
j++;
}
longest = longest.substring(0, j);
}
return longest;
}
}