LeetCode 014 Longest Common Prefix

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

If there is no common prefix, return an empty string "".

class Solution {
    public String longestCommonPrefix(String[] strs) {
        // 注意先判断输入的字符串数组是否为空
        int num = strs.length;
        if(num == 0) return "";

        // 其次判断字符串数组中元素是否只有一个
        if(num == 1) return strs[0];

        if(strs[0].equals("")) return "";

        int length = strs[0].length();
        for(int i = 0; i < length; i++) {
            String temp = strs[0].substring(0, i + 1);
                for(int j = 1; j < num; j++) {
                    if(!strs[j].startsWith(temp)) {
                        return strs[0].substring(0, i);
                    }
                }
        }
        // 执行到这说明数组元素全部相同
        return strs[0];
    }
}