Find the longest common prefix for a given array of strings

longestCommonPrefix.java

public String longestCommonPrefix(String[] strs) {
    if(strs == null || strs.length == 0)
        return "";
    int minLength = getMinLength(strs);
    for(int i = 0; i < minLength; i++) {            //For each index
        char ch = strs[0].charAt(i);            
        for(int j = 1; j < strs.length; j++){      // For each string
            if(strs[j].charAt(i) != ch)
                return strs[0].substring(0, i);
        }
    }
    return strs[0].substring(0, minLength);
}

private int getMinLength(String[] strs){
    int min = strs[0].length();
    for(int i = 1; i < strs.length; i++){
        min = Math.min(strs[i].length(), min);
    }
    return min;
}