最大相同子串
阿新 • • 發佈:2021-12-30
不知道為什麼測試用例idea能通過,leecode通過不了,煩
class Solution { public String longestCommonPrefix(String[] strs) { if(strs.length==0||strs[0].toString()=="") { return ""; }else { String record = ""; String shortest = strs[0]; /** *找到最短的那個單詞*/ for (int i = 1; i < strs.length; i++) { if (strs[i].length() < shortest.length()) { shortest = strs[i]; } } // System.out.println(shortest); int i = 0; for (; i < strs.length ; i++) {//i表示第i個單詞if(strs[i].length()>0) for (int j = 0; j < strs.length; j++) {//j表示單詞的第j個字母 if (shortest.charAt(i) == strs[j].charAt(i)) { if (shortest.charAt(i) == strs[strs.length - 1].charAt(j)) { record += strs[strs.length - 1].charAt(j); }continue; } else break; } } return record; } // record = shortest.substring(0, i-1); // System.out.println(record); } public int[] twoSum(int[] nums, int target) { int[] num = new int[2]; for (int i = 0; i < nums.length; i++) { for (int j = 0; j < nums.length; j++) { if (target == nums[i] + nums[j]) { if (i != j) { num = new int[]{i, j}; return num; } else if (i == j) break; } else { continue; } } } return num; } }