leetcode14最大公共前缀

之前的不知道为什么idea能通过，leetcode通过不了，重新写了个暴力破解

  String shortest = strs[0];
        for (int i = 0; i < strs.length; i++) {  //
            if (strs.length == 1) {
                return shortest;
            } else if (strs[i] == "" || strs[i].length() == 0) {

                return "";
            } 
                for (int j = 0; j < strs.length; j++) {
                if (shortest.length() > strs[j].length()) {
                    shortest = strs[j];
                }

                }
                for (int j = 0; j < shortest.length(); j++) {
                    for (int k = 0; k < strs.length; k++) {

                        if (strs[k].charAt(j) == shortest.charAt(j)) {
                            continue;
                        } else {
                            System.out.println(shortest.substring(0,j));
                            return shortest.substring(0, j);
                        }
                    }
                }

            
        }
        return shortest.substring(0);