public String longestCommonPrefix(String[] strs) {
        //判斷極限情況
        if (strs == null || strs.length == 0) {
            return "";
        }
        if (strs.length == 1) {
            return strs[0];
        }

        String result = strs[0];  //默認用第一個字符串比較

        for (int i = 1; i < strs.length; i++) {//所以從第二個字符串開始比

            char[] chars = strs[i].toCharArray();
            int start = -1; //索引
            int length = 0;

            for (int j = 0; j < chars.length; j++) {

                if (result.length() > j) {
 
                    if (result.charAt(j) == chars[j]) {
                        if (start == -1) {//判斷開始索引
                            start = j;
                        }
                        length++; //判斷l(xiāng)ength
                    }else{
                        break;
                    }
                }
            }
          
            if (start != -1) {//判斷是否有公共，處理截取
                result = result.substring(start, start + length);
            } else {
                result = "";
            }
        }
        return result;
    }