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.length == 0) return "";
if (strs.length == 1) return strs[0];
StringBuilder strBuilder = new StringBuilder();
for (int i = 0; i < strs[0].length(); i++) {
char ch = strs[0].charAt(i);
for (int j = 0; j < strs.length; j++) {
if (i >= strs[j].length()) return strBuilder.toString();
if (strs[j].charAt(i) != ch) return strBuilder.toString();
}
strBuilder.append(ch);
}
return strBuilder.toString();
}
}