LeetCode刷题答案

比眉伴天荒 2022-04-24 09:46 455阅读 0赞

目录

  1. 无重复字符的最长子串

  1. 寻找两个有序数组的中位数

  2. 最长的回文子串

6.Z 字形变换

  1. 字符串转换整数 (atoi)

    1. 回文数

  2. 盛最多水的容器

  3. 整数转罗马数字

  4. 罗马数字转整数

  5. 最长公共前缀

  6. 三数之和

    1. 最接近的三数之和

  7. 四数之和

    1. 有效的括号

  8. 合并两个有序链表

  9. 删除排序数组中的重复项

  10. 移除元素

  11. 实现 strStr()

  12. 搜索插入位置

    1. 报数

  13. 最大子序和

持续更新中………

3. 无重复字符的最长子串

  1. package cn.zh.t3;
  3. /**
  4.  * 无重复字符最长子串
  5.  */
  6. public class Test3 {
  7.     public static int lengthOfLongestSubstring(String s) {
  8.         int l = 0;
  9.         int r = 0;
  10.         int[] temp = new int[128];
  11.         int maxlen = 0;
  12.         while(l<s.length()){
  13.             if(r<s.length() && temp[s.charAt(r)] == 0){
  15.                 temp[s.charAt(r)]++;
  17.                 r++;
  18.             }else{
  19.                 maxlen = Math.max(maxlen,r-l);
  21.                 temp[s.charAt(l)]--;
  22.                 l++;
  23.             }
  25.         }
  26.         return maxlen;
  28.     }
  29.     public static void main(String[] args) {
  30.         String string ="abcabcbb";
  31.         System.out.println(lengthOfLongestSubstring(string));
  32. //        int[] a = new int[344];
  33. //        System.out.println(string.charAt(4));
  34. //        for(int i = 0 ;i<string.length();i++){
  35. //            System.out.println(a[string.charAt(i)]);
  36. //
  37. //        }
  39.     }
  40. }

4. 寻找两个有序数组的中位数

  1. package cn.zh.t3;
  3. /**
  4.  * 最长回文子串
  5.  */
  6. public class Test4 {
  7.     public static void main(String[] args) {
  8.         String s = "a";
  10.         System.out.println(longestPalindrome(s));
  11.     }
  12.     public static  String longestPalindrome(String s) {
  13.         int max = 0;
  14.         int len = s.length();
  15.         String test=null;
  16.         String ans = null;
  17.         for (int i = 0; i < len/2;i++){
  18.             for (int j = i+1;j < len;j++){
  19.                 test = s.substring(i,j);
  20.                 if (fun(test) && (test.length()>max)){
  21.                     max = test.length();
  22.                     ans = s.substring(i,j);
  23.                 }
  24.             }
  25.         }
  26.         return  ans;
  28.     }
  29.     public static boolean fun(String s){
  31.         int len = s.length();
  33.             if (s.charAt(0) != s.charAt(len - 1)) {//判断首字符和尾字符是否相等
  34.                 return false;
  35.              }
  36.         return true;//首位相等
  37.     }
  40. }

5. 最长的回文子串

  1. package cn.zh.t3;
  3. public class Test5 {
  4.     public static String longestPalindrome1(String s) {
  5.         if (s == null || s.length() == 0) {
  6.             return s;
  7.         }
  8.         String res = "";
  9.         boolean[][] dp = new boolean[s.length()][s.length()];
  10.         int max = 0;
  11.         for (int j = 0; j < s.length(); j++) {
  12.             for (int i = 0; i <= j; i++) {
  13.                 dp[i][j] = s.charAt(i) == s.charAt(j) && ((j - i <= 2) || dp[i + 1][j - 1]);
  14.                 if (dp[i][j]) {
  15.                     if (j - i + 1 > max) {
  16.                         max = j - i + 1;
  17.                         res = s.substring(i,j + 1);
  18.                     }
  19.                 }
  20.             }
  21.         }
  22.         return res;
  23.     }
  24.     //------------------------------------------
  25.     public static String res = "";
  26.     public static String longestPalindrome2(String s) {
  28.         if (s == null || s.length() == 0) {
  29.             return s;
  30.         }
  31.         for (int i = 0; i < s.length(); i++) {
  32.             helper(s,i,i);
  33.             helper(s,i,i + 1);
  34.         }
  35.         return res;
  36.     }
  37.     public static void helper(String s,int left,int right) {
  38.         while (left > 0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
  39.             left--;
  40.             right++;
  41.         }
  43.         String cur = s.substring(left + 1,right);
  46.         if (cur.length() > res.length()) {
  47.             res = cur;
  48.         }
  49.     }
  51.     public static void main(String[] args) {
  52.         String s = "babad";
  53.         System.out.println(longestPalindrome2(s));
  54.     }
  55. }

6.Z 字形变换

  1. package cn.zh.t3;
  3. public class Test6 {
  4.     public static String convert(String s, int numRows) {
  6.         if (numRows == 1) return s;
  8.         StringBuilder ret = new StringBuilder();
  9.         int n = s.length();
  10.         int cycleLen = 2 * numRows - 2;
  12.         for (int i = 0; i < numRows; i++) {
  13.             for (int j = 0; j + i < n; j += cycleLen) {
  14.                 ret.append(s.charAt(j + i));
  15.                 if (i != 0 && i != numRows - 1 && j + cycleLen - i < n)
  16.                     ret.append(s.charAt(j + cycleLen - i));
  17.             }
  18.         }
  20.         return ret.toString();
  21.     }
  23.     public static void main(String[] args) {
  24.         String string = "LEETCODEISHIRING";
  25.         int numRows = 3;
  26.         System.out.println(convert(string,numRows));
  27.     }
  29. }

8. 字符串转换整数 (atoi)

  1. package cn.zh.t3;
  3. /**
  4.  * 1.首先去除字符串左右空格,不符合条件的直接return 0;
  5.  * 2.sign是符号位,start指针指向第一个数字的位置,如果第一位为数字,则sign=1,start=0,否则firstChar接收字符串第一个字符,若为“+”、“-”,sign分别赋值1、-1,start自增1,
  6.  * 3.从字符串第一个为数字的位置开始遍历,res为无符号结果,如果res大于Integer最大值且sign=1,输出Integer的最大值,反之输出Integer最小值,如果遍历到不为数字的字符,则直接返回res*sign;
  7.  * 4.如果遍历时该字符串未超范围,且无非数字字符,则返回res * sign;
  8.  *
  9.  */
  10. public class Test8 {
  11.     public static int myAtoi(String str) {
  12.         //1.首先去除字符串左右空格,不符合条件的直接return 0;
  13.         str=str.trim();
  14.         if (str == null || str.length() == 0) {
  15.             return 0;
  17.         }
  18.         int sign = 1;
  19.         if(str.charAt(0) == '-'){
  20.             sign = -1;
  21.             str = str.substring(1);
  23.         }else if(str.charAt(0) == '+'){
  24.             sign = 1;
  25.             str= str.substring(1);
  26.         }
  27.         long ans = 0;
  28.         for(int i = 0; i<str.length();i++) {
  29.             char val = str.charAt(i);
  30.             if(!Character.isDigit(val))
  31.                 break;
  32.             ans = ans*10 + (val - '0');
  33.             if (ans*sign<Integer.MIN_VALUE) return Integer.MIN_VALUE;
  34.             if(ans*sign>Integer.MAX_VALUE) return Integer.MAX_VALUE;
  36.         }
  37.         return (int)ans*sign;
  39.     }
  41.     public static void main(String[] args) {
  42.         String string = "123 4 ee ";
  44.         System.out.println(myAtoi(string));
  47.     }
  48. }

9. 回文数

  1. package cn.zh.t3;
  3. public class Test9 {
  4.     public static boolean isPalindrome(int x) {
  5.         int k = x;
  6.         int y = 0;
  7.         if (x<0){
  8.          return false;
  9.         }
  10.         while (x!=0){
  11.          y=y*10+x%10;
  12.          x/=10;
  13.         }
  14.         if (k == y) {
  15.             return true;
  17.         }else{
  18.             return false;
  19.         }
  20.     }
  22.     public static void main(String[] args) {
  23.         System.out.println(isPalindrome(12321));
  24.     }
  25. }

11. 盛最多水的容器

  1. package cn.zh.t3;
  3. public class Test11 {
  4.     public static int maxArea(int[] height) {
  5.         int res = 0;
  6.         int l = 0, r = height.length - 1;
  7.         while (l < r) {
  8.             res = Math.max(res,Math.min(height[l],height[r])*(r - l));
  9.             if (height[l] < height[r]) {
  10.                 l++;
  12.             }else r--;
  13.         }
  14.         return res;
  15.     }
  17.     public static void main(String[] args) {
  18.         int[] height = {1,8,6,2,5,4,8,3,7};
  19.         System.out.println(maxArea(height));
  20.     }
  21. }

12. 整数转罗马数字

  1. package cn.zh.t3;
  3. public class Test12 {
  4.     public static String intToRoman(int num) {
  5.         int[] values = {1000,900,500,400,100,90,50,40,10,9,5,4,1};
  6.         String[] strs = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
  7.         StringBuilder sb = new StringBuilder();
  8.         for (int i = 0; i < values.length; i++) {
  9.             while (num >= values[i]) {
  10.                 num -= values[i];
  11.                 sb.append(strs[i]);
  12.             }
  13.         }
  14.         return sb.toString();
  15.     }
  17.     public static void main(String[] args) {
  18.         System.out.println(intToRoman(4));
  19.     }
  20. }

13. 罗马数字转整数

  1. package cn.zh.t3;
  3. import java.util.HashMap;
  4. import java.util.Map;
  6. public class Test13 {
  7.     public static int romanToInt(String s) {
  8.         Map<String,Integer> map = new  HashMap<String,Integer>();
  9.         map.put("I", 1);
  10.         map.put("IV", 4);
  11.         map.put("V", 5);
  12.         map.put("IX", 9);
  13.         map.put("X", 10);
  14.         map.put("XL", 40);
  15.         map.put("L", 50);
  16.         map.put("XC", 90);
  17.         map.put("C", 100);
  18.         map.put("CD", 400);
  19.         map.put("D", 500);
  20.         map.put("CM", 900);
  21.         map.put("M", 1000);
  23.         int ans = 0;
  24.         for(int i = 0;i < s.length();) {
  25.             if(i + 1 < s.length() && map.containsKey(s.substring(i, i+2))) {
  26.                 ans += map.get(s.substring(i, i+2));
  27.                 i += 2;
  28.             } else {
  29.                 ans += map.get(s.substring(i, i+1));
  30.                 i ++;
  31.             }
  32.         }
  33.         return ans;
  36.     }
  38.     public static void main(String[] args) {
  39.         String s = "MCMXCIV";
  40.         System.out.println(romanToInt(s));
  42.     }
  43. }

14. 最长公共前缀

  1. package cn.zh.t3;
  3. public class Test14 {
  4.     public static String longestCommonPrefix(String[] strs) {
  5.         if(strs == null || strs.length == 0) return "";
  6.         String res = strs[0];
  7.         for (int i = 0; i < strs.length; i++) {
  9.             while (strs[i].indexOf(res) != 0 ){
  10.                 res = res.substring(0,res.length() - 1);
  11.             }
  12.         }
  13.         return res;
  14.     }
  16.     public static void main(String[] args) {
  17.         String[] strs=  {"flower","flow","flight"};
  18.         String s = longestCommonPrefix(strs);
  19.         System.out.println(s);
  20.     }
  21. }

15. 三数之和

  1. package cn.zh.t3;
  3. import java.util.ArrayList;
  4. import java.util.Arrays;
  5. import java.util.List;
  7. public class Test15 {
  8.     public static List<List<Integer>> threeSum1(int[] nums) {
  9.         List<List<Integer>> res = new ArrayList<>();
  11.         Arrays.sort(nums);
  12.         for (int i = 0; i < nums.length-2; i++) {
  13.             if (i > 0 && nums[i] == nums[i - 1]) continue;//去重
  14.             int low = i + 1, high = nums.length - 1, sum = 0 - nums[i];
  15.             while (low < high) {
  16.                 if (nums[low] + nums[high] == sum) {
  17.                     res.add(Arrays.asList(nums[i],nums[low],nums[high]));
  18.                     while (low < high && nums[low] == nums[low + 1]) low++;//去重
  19.                     while (low < high && nums[high] == nums[high - 1]) high--;//去重
  20.                     low++;
  21.                     high--;
  23.                 } else if (nums[low] + nums[high] <sum) {
  24.                     low++;
  25.                 } else {
  26.                     high--;
  27.                 }
  28.             }
  29.         }
  30.         return res;
  31.     }
  34.     public static List<List<Integer>> threeSum2(int[] nums) {
  35.         List<List<Integer>> ans = new ArrayList();
  36.         int len = nums.length;
  37.         if(nums == null || len < 3) return ans;
  38.         Arrays.sort(nums); // 排序
  39.         for (int i = 0; i < len ; i++) {
  40.             if(nums[i] > 0) break; // 如果当前数字大于0，则三数之和一定大于0，所以结束循环
  41.             if(i > 0 && nums[i] == nums[i-1]) continue; // 去重
  42.             int L = i+1;
  43.             int R = len-1;
  44.             while(L < R){
  45.                 int sum = nums[i] + nums[L] + nums[R];
  46.                 if(sum == 0){
  47.                     ans.add(Arrays.asList(nums[i],nums[L],nums[R]));
  48.                     while (L<R && nums[L] == nums[L+1]) L++; // 去重
  49.                     while (L<R && nums[R] == nums[R-1]) R--; // 去重
  50.                     L++;
  51.                     R--;
  52.                 }
  53.                 else if (sum < 0) L++;
  54.                 else if (sum > 0) R--;
  55.             }
  56.         }
  57.         return ans;
  58.     }
  60.     public static void main(String[] args) {
  61.         int[] nums = {-1, 0, 1, 2, -1, -4};
  62.         System.out.println(threeSum2(nums));
  63.     }
  64. }

16. 最接近的三数之和

  1. package cn.zh.t3;
  3. import java.util.Arrays;
  5. public class Test16 {
  6.     public static int threeSumClosest(int[] nums, int target) {
  7.         int res = nums[0] + nums[1] + nums[nums.length - 1];
  8.         Arrays.sort(nums);
  9.         for (int i = 0; i < nums.length; i++) {
  10.             int start = i + 1, end = nums.length - 1;
  11.             while (start < end) {
  12.                 int sum = nums[i] + nums[start] + nums[end];
  13.                 if (sum > target) {
  14.                     end--;
  16.                 } else start++;
  17.                 if (Math.abs(sum - target)<Math.abs(res - target)) {
  18.                     res = sum;
  19.                 }
  20.             }
  21.         }
  22.         return res;
  23.     }
  25.     public static void main(String[] args) {
  26.         int[] nums = {-1,2,1,-4};
  27.         System.out.println(threeSumClosest(nums,1));
  28.     }
  29. }

18. 四数之和

  1. package cn.zh.t3;
  3. import java.util.ArrayList;
  4. import java.util.Arrays;
  5. import java.util.List;
  7. public class Test18 {
  8.     public static List<List<Integer>> fourSum(int[] nums, int target) {
  9.         List<List<Integer>> res = new ArrayList<>();
  10.         if (nums.length < 4) return res;
  11.         Arrays.sort(nums);
  12.         for (int i = 0; i < nums.length - 3; i++) {
  13.             if (i > 0 && nums[i] == nums[i-1]) continue;
  14.             for (int j = i + 1; j < nums.length -2; j++) {
  15.                 if (j > i + 1 && nums[j] == nums[j - 1]) continue;
  16.                 int low = j + 1, high = nums.length - 1;
  17.                 while (low < high) {
  18.                     int sum = nums[i] + nums[j] + nums[low] + nums[high];
  19.                     if (sum == target) {
  20.                         res.add(Arrays.asList(nums[i],nums[j],nums[low],nums[high]));
  21.                         while (low < high && nums[low] == nums[low + 1]) low++;
  22.                         while (low < high && nums[high] == nums[high - 1]) high--;
  23.                         low++;
  24.                         high--;
  25.                     } else if (sum < target) {
  26.                         low++;
  27.                     } else high--;
  28.                 }
  29.             }
  30.         }
  31.         return res;
  32.     }
  34.     public static void main(String[] args) {
  35.         int[] a = {1,0,-1,0,-2,2};
  36.         System.out.println(fourSum(a,0));
  38.     }
  39. }

20. 有效的括号

  1. package cn.zh.t3;
  3. import java.util.Stack;
  5. public class Test20 {
  6.     public static boolean isValid(String s) {
  7.         if (s == null || s.length() == 0) return true;
  8.         Stack<Character> stack = new Stack<>();
  9.         for (Character ch : s.toCharArray()) {
  10.             if (ch == '(') {
  11.                 stack.push(')');
  12.             } else if (ch == '[') {
  13.                 stack.push(']');
  15.             } else if (ch == '{') {
  16.                 stack.push('}');
  17.             } else {
  18.                 if (stack.isEmpty() || stack.pop() != ch) {
  19.                     return false;
  20.                 }
  21.             }
  22.         }
  23.         return stack.isEmpty();
  24.     }
  26.     public static void main(String[] args) {
  27.         String s = "()[]{}";
  28.         boolean valid = isValid(s);
  29.         System.out.println(valid);
  30.     }
  31. }

21. 合并两个有序链表

  1. package cn.zh.t3;
  2. class ListNode {
  3.     int val;
  4.     ListNode next;
  5.     ListNode(int x ){
  6.         val = x;
  7.     }
  8. }
  9.  public class Test21 {
  11.     public ListNode mergeTwoLists1(ListNode l1, ListNode l2) {
  12.         ListNode dummy = new ListNode(0);
  13.         ListNode cur = dummy;
  14.         while(l1 != null || l2 != null) {
  15.             if (l1.val<l2.val) {
  16.                 cur.next = new ListNode(l1.val);
  17.                 l1 = l1.next;
  18.             } else {
  19.                 cur.next = new ListNode(l2.val);
  20.                 l2 = l2.next;
  21.             }
  22.             cur = cur.next;
  23.         }
  24.         if (l1!= null) {
  25.             cur.next = l1;
  27.         } else {
  28.             cur.next = l2;
  29.         }
  30.         return dummy.next;
  31.     }
  33.      public ListNode mergeTwoLists2(ListNode l1, ListNode l2) {
  34.          if (l1 == null) {
  35.              return l2;
  36.          }
  37.          if(l2 == null) {
  38.              return l1;
  39.          }
  40.          if (l1.val < l2.val) {
  41.              l1.next = mergeTwoLists2(l1.next, l2);
  42.              return l1;
  43.          } else {
  44.              l2.next = mergeTwoLists2(l1, l2.next);
  45.              return l2;
  46.          }
  48.      }
  51. }

26. 删除排序数组中的重复项

  1. package cn.zh.t3;
  3. public class Test26 {
  4.     public static int removeDuplicates(int[] nums) {
  5.         if (nums == null || nums.length == 0){
  6.             return 0;
  7.         }
  8.         int count = 1;
  9.         for (int i = 1; i < nums.length; i++) {
  10.             if (nums[i - 1] != nums[i]) {
  11.                 nums[count++] = nums[i];
  12.             }
  13.         }
  14.         return count;
  15.     }
  17.     public static void main(String[] args) {
  18.         int[] nums = {0,0,1,1,1,2,2,3,3,4};
  19.         System.out.println(removeDuplicates(nums));
  21.     }
  22. }

27. 移除元素

  1. package cn.zh.t3;
  3. public class Test27 {
  4.     public static  int removeElement(int[] nums, int val) {
  5.         if (nums == null || nums.length == 0)
  6.             return 0;
  7.         int count = 0;
  8.         for (int i = 0; i < nums.length; i++) {
  9.             if (nums[i] != val){
  10.                 nums[count++] = nums[i];
  11.             }
  12.         }
  13.         return count;
  14.     }
  16.     public static void main(String[] args) {
  17.       int[] nums = {0,1,2,2,3,0,4,2};
  18.         System.out.println(removeElement(nums,2));
  19.     }
  20. }

28. 实现 strStr()

  1. package cn.zh.t3;
  3. public class Test28 {
  4.     public static int strStr(String haystack, String needle) {
  5.         if (needle == null)
  6.             return 0;
  7.         for (int i = 0;i <= haystack.length()-needle.length(); i++) {
  8.             if (haystack.substring(i,i+needle.length()).equals(needle))
  9.                 return i;
  10.         }
  11.         return -1;
  12.     }
  14.     public static void main(String[] args) {
  15.         String h = "hello";
  16.         String n = "ll";
  17.         System.out.println(strStr(h,n));
  18.     }
  19. }

35. 搜索插入位置

  1. package cn.zh.t3;
  3. public class Test35 {
  4.     public static int searchInsert(int[] nums, int target) {
  5.         int left = 0;
  6.         int right = nums.length-1;
  7.         while(left <= right) {
  8.             int mid = (left + right)/2;
  9.             if (nums[mid] == target) {
  10.                 return mid;
  11.             }else if(nums[mid] < target){
  12.                 left = mid + 1;
  13.             }else{
  14.                 right = mid - 1;
  15.             }
  16.         }
  17.         return left;
  18.     }
  20.     public static void main(String[] args) {
  21.         int nums[] = {1, 2, 4, 5, 7,8, 9};
  22.         int target = 3;
  23.         System.out.println(searchInsert(nums,target));
  24.     }
  26. }

38. 报数

  1. package cn.zh.t3;
  3. public class Test38 {
  4.     public static String countAndSay(int n) {
  5.         int i = 1;
  6.         String res = "1";
  7.         while (i < n) {
  8.             int count = 0;
  9.             StringBuilder sb = new StringBuilder();
  10.             char c = res.charAt(0);
  11.             for (int j = 0; j < res.length(); j++) {
  12.                 if (j != res.length() && res.charAt(j) == c) {
  13.                     count++;
  14.                 } else {
  15.                     sb.append(count);
  16.                     sb.append(c);
  17.                     if (j != res.length()) {
  18.                         count = 1;
  19.                         c = res.charAt(j);
  20.                     }
  21.                 }
  22.             }
  23.             res = sb.toString();
  24.             i++;
  25.         }
  26.         return res;
  27.     }
  29.     public static void main(String[] args) {
  30.         String s = countAndSay(2);
  31.         System.out.println(s);
  32.     }
  33. }

53. 最大子序和

  1. package cn.zh.t3;
  3. public class Test53 {
  5.     public static int maxSubArray(int[] nums) {
  6.         int maxSum = nums[0];
  7.         int thisSum = 0;
  8.         for(int num: nums) {
  9.             if(thisSum > 0) {
  10.                 thisSum += num;
  11.             } else {
  12.                 thisSum = num;
  13.             }
  14.             maxSum = Math.max(maxSum, thisSum);
  15.         }
  16.         return maxSum;
  18.     }
  20.     public static void main(String[] args) {
  22.         int[] n = {-2,1,-1,4,};
  23.         System.out.println(maxSubArray(n));
  24.     }
  25. }

持续更新中………

发表评论

表情：
评论列表 （有 0 条评论，455人围观）

还没有评论，来说两句吧...

相关阅读

    相关 52LeetCode刷题_LeetCode刷题手册

    虽然刷题一直饱受诟病，不过不可否认刷题确实能锻炼我们的编程能力，相信每个认真刷题的人都会有体会。现在提供在线编程评测的平台有很多，比较有名的有 hihocoder，LintCo

    女爷i女爷i/ 0 赞/ 35 阅读

    相关 LeetCode刷题指南

    以下是我个人做题过程中的一些体会：  1. LeetCode的题库越来越大，截止到目前，已经有321个问题了。对于大多数人来说，没有时间也没有必要把所有题目都做一遍（时间充

    àì夳堔傛蜴生んèńàì夳堔傛蜴生んèń/ 0 赞/ 459 阅读

    相关 Leetcode刷题

    39. 组合总和 给定一个无重复元素的数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

    秒速五厘米秒速五厘米/ 0 赞/ 720 阅读