55. 56. 62. 64. 22.

Dagon0577 · Dagon0577 · commit 9a49dd8f8125 · 2020-04-09T00:14:23.000+08:00
diff --git a/LeetcodeTop100/10. 正则表达式匹配.java b/LeetcodeTop100/10. 正则表达式匹配.java
@@ -5,7 +5,7 @@ public boolean isMatch(String s, String p) {
         }
         boolean[][] dp = new boolean[s.length() + 1][p.length() + 1];
         dp[0][0] = true;// dp[i][j] 表示 s 的前 i 个是否能被 p 的前 j 个匹配
-        for (int i = 0; i < p.length(); i++) {
+        for (int i = 1; i < p.length(); i++) {
             if (p.charAt(i) == '*' && dp[0][i - 1]) {
                 dp[0][i + 1] = true;
             }
@@ -14,17 +14,16 @@ public boolean isMatch(String s, String p) {
             for (int j = 0; j < p.length(); j++) {
                 if (p.charAt(j) == '.' || p.charAt(j) == s.charAt(i)) {// 如果是任意元素 或者是对于元素匹配
                     dp[i + 1][j + 1] = dp[i][j];
-                }
-                if (p.charAt(j) == '*') {
-                    if (p.charAt(j - 1) != s.charAt(i) && p.charAt(j - 1) != '.') {// 如果前一个元素不匹配 且不为任意元素
+                } else if (p.charAt(j) == '*') {
+                    if (p.charAt(j - 1) != s.charAt(i) && p.charAt(j - 1) != '.') {// 如果前一个元素不匹配 且不为任意元素 没有匹配的情况
                         dp[i + 1][j + 1] = dp[i + 1][j - 1];
                     } else {
                         // dp[i + 1][j + 1] = (dp[i + 1][j] || dp[i][j + 1] || dp[i + 1][j - 1]);
                         dp[i + 1][j + 1] = (dp[i][j + 1] || dp[i + 1][j] || dp[i + 1][j - 1]);
                         /*
                          * dp[i][j] = dp[i-1][j] // 多个字符匹配的情况 
-                         * or dp[i][j] = dp[i][j-1] // 单个字符匹配的情况
-                         * or dp[i][j] = dp[i][j-2] // 没有匹配的情况
+                         * or dp[i][j] = dp[i][j-1] // 单个字符匹配的情况 
+                         * or dp[i][j] = dp[i][j-2] // 没有匹配的情况（虽然p.charAt(j - 1) == s.charAt(i)但是其实不能匹配，即为零个）
                          */
                     }
                 }
diff --git a/LeetcodeTop100/55. 跳跃游戏.java b/LeetcodeTop100/55. 跳跃游戏.java
@@ -0,0 +1,11 @@
+class Solution {
+    public boolean canJump(int[] nums) {
+        int lastPos = nums.length - 1;
+        for(int i = nums.length - 1; i >= 0; i--){
+            if(i + nums[i] >= lastPos){
+                lastPos = i;
+            }
+        }
+        return lastPos == 0;
+    }
+}
diff --git a/LeetcodeTop100/56. 合并区间.java b/LeetcodeTop100/56. 合并区间.java
@@ -0,0 +1,36 @@
+class Solution {
+    public int[][] merge(int[][] intervals) {
+        if (intervals.length == 0) {
+            return intervals;
+        }
+        int n = intervals.length;
+        int[] starts = new int[n];
+        int[] ends = new int[n];
+        for (int i = 0; i < n; i++) {
+            starts[i] = intervals[i][0];
+            ends[i] = intervals[i][1];
+        }
+        Arrays.sort(starts);
+        Arrays.sort(ends);
+        int start = starts[0];
+        int i = 0, j = 0;
+        int count = 0;
+        List<int[]> list = new ArrayList<>();
+        while (i < n || j < n) {
+            if (i < n && starts[i] <= ends[j]) {
+                count++;
+                if (count == 1) {
+                    start = starts[i];
+                }
+                i++;
+            } else {
+                count--;
+                if (count == 0) {
+                    list.add(new int[] { start, ends[j] });
+                }
+                j++;
+            }
+        }
+        return list.toArray(new int[list.size()][]);
+    }
+}
diff --git a/LeetcodeTop100/62. 不同路径.java b/LeetcodeTop100/62. 不同路径.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int uniquePaths(int m, int n) {
+        int[][] result = new int[m][n];
+        for (int i = 0; i < m; i++) {
+            result[i][0] = 1;
+        }
+        for (int j = 0; j < n; j++) {
+            result[0][j] = 1;
+        }
+        for (int i = 1; i < m; i++) {
+            for (int j = 1; j < n; j++) {
+                result[i][j] = result[i][j - 1] + result[i - 1][j];
+            }
+        }
+        return result[m - 1][n - 1];
+    }
+}
diff --git a/LeetcodeTop100/64. 最小路径和.java b/LeetcodeTop100/64. 最小路径和.java
@@ -0,0 +1,18 @@
+class Solution {
+    public int minPathSum(int[][] grid) {
+        int m = grid.length;
+        int n = grid[0].length;
+        for (int i = 1; i < m; i++) {
+            grid[i][0] += grid[i - 1][0];
+        }
+        for (int j = 1; j < n; j++) {
+            grid[0][j] += grid[0][j - 1];
+        }
+        for (int i = 1; i < m; i++) {
+            for (int j = 1; j < n; j++) {
+                grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
+            }
+        }
+        return grid[m - 1][n - 1];
+    }
+}
diff --git a/README.md b/README.md
@@ -2,50 +2,55 @@
 
 ## LeetcodeTop100🔥
 [题目链接👈](https://leetcode-cn.com/problemset/all/?listId=2cktkvj)
-- [1. 两数之和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/1.%20%E4%B8%A4%E6%95%B0%E4%B9%8B%E5%92%8C.java)
-- [2. 两数相加](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/2.%20%E4%B8%A4%E6%95%B0%E7%9B%B8%E5%8A%A0.java)
-- [3. 无重复字符的最长子串](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/3.%20%E6%97%A0%E9%87%8D%E5%A4%8D%E5%AD%97%E7%AC%A6%E7%9A%84%E6%9C%80%E9%95%BF%E5%AD%90%E4%B8%B2.java)
+- [1. 两数之和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/1.%20两数之和.java)
+- [2. 两数相加](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/2.%20两数相加.java)
+- [3. 无重复字符的最长子串](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/3.%20无重复字符的最长子串.java)
   - [思路](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/3.Ideas.md)
-- [4. 寻找两个有序数组的中位数](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/4.%20%E5%AF%BB%E6%89%BE%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E4%B8%AD%E4%BD%8D%E6%95%B0.java)
+- [4. 寻找两个有序数组的中位数](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/4.%20寻找两个有序数组的中位数.java)
   - [思路](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/4.Ideas.md)
-- [5. 最长回文子串](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/5.%20%E6%9C%80%E9%95%BF%E5%9B%9E%E6%96%87%E5%AD%90%E4%B8%B2.java)
+- [5. 最长回文子串](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/5.%20最长回文子串.java)
   - [思路](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/5.Ideas.md)
-- [10. 正则表达式匹配](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/10.%20%E6%AD%A3%E5%88%99%E8%A1%A8%E8%BE%BE%E5%BC%8F%E5%8C%B9%E9%85%8D.java)
-- [11. 盛最多水的容器](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/11.%20%E7%9B%9B%E6%9C%80%E5%A4%9A%E6%B0%B4%E7%9A%84%E5%AE%B9%E5%99%A8.java)
-- [15. 三数之和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/15.%20%E4%B8%89%E6%95%B0%E4%B9%8B%E5%92%8C.java)
-- [17. 电话号码的字母组合](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/17.%20%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.java)
-- [19. 删除链表的倒数第N个节点](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/19.%20%E5%88%A0%E9%99%A4%E9%93%BE%E8%A1%A8%E7%9A%84%E5%80%92%E6%95%B0%E7%AC%ACN%E4%B8%AA%E8%8A%82%E7%82%B9.java)
-- [20. 有效的括号](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/20.%20%E6%9C%89%E6%95%88%E7%9A%84%E6%8B%AC%E5%8F%B7.java)
-- [21. 合并两个有序链表](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/21.%20%E5%90%88%E5%B9%B6%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E9%93%BE%E8%A1%A8.java)
-- [22. 括号生成](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/22.%20%E6%8B%AC%E5%8F%B7%E7%94%9F%E6%88%90.java)
+- [10. 正则表达式匹配](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/10.%20正则表达式匹配.java)
+- [11. 盛最多水的容器](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/11.%20盛最多水的容器.java)
+- [15. 三数之和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/15.%20三数之和.java)
+- [17. 电话号码的字母组合](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/17.%20电话号码的字母组合.java)
+- [19. 删除链表的倒数第N个节点](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/19.%20删除链表的倒数第N个节点.java)
+- [20. 有效的括号](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/20.%20有效的括号.java)
+- [21. 合并两个有序链表](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/21.%20合并两个有序链表.java)
+- [22. 括号生成](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/22.%20括号生成.java)
 - 23.合并K个排序链表
-  - [23. 合并K个排序链表](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/23.%20%E5%90%88%E5%B9%B6K%E4%B8%AA%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8.java)
-  - [23. 合并K个排序链表（堆排序）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/23.%20%E5%90%88%E5%B9%B6K%E4%B8%AA%E6%8E%92%E5%BA%8F%E9%93%BE%E8%A1%A8%EF%BC%88%E5%A0%86%E6%8E%92%E5%BA%8F%EF%BC%89.java)
-- [31. 下一个排列](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/31.%20%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%8E%92%E5%88%97.java)
+  - [23. 合并K个排序链表](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/23.%20合并K个排序链表.java)
+  - [23. 合并K个排序链表（堆排序）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/23.%20合并K个排序链表（堆排序）.java)
+- [31. 下一个排列](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/31.%20下一个排列.java)
 - 32.最长有效括号
-  - [32. 最长有效括号（dp）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/32.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7.java)
-  - [32. 最长有效括号（栈）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/32.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7%EF%BC%88%E6%A0%88%EF%BC%89.java)
-  - [32. 最长有效括号（空间O（1））](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/32.%20%E6%9C%80%E9%95%BF%E6%9C%89%E6%95%88%E6%8B%AC%E5%8F%B7%EF%BC%88%E7%A9%BA%E9%97%B4O%EF%BC%881%EF%BC%89%EF%BC%89.java)
-- [33. 搜索旋转排序数组](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100%/33.%20%E6%90%9C%E7%B4%A2%E6%97%8B%E8%BD%AC%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84.java)
-- [34. 在排序数组中查找元素的第一个和最后一个位置](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/34.%20%E5%9C%A8%E6%8E%92%E5%BA%8F%E6%95%B0%E7%BB%84%E4%B8%AD%E6%9F%A5%E6%89%BE%E5%85%83%E7%B4%A0%E7%9A%84%E7%AC%AC%E4%B8%80%E4%B8%AA%E5%92%8C%E6%9C%80%E5%90%8E%E4%B8%80%E4%B8%AA%E4%BD%8D%E7%BD%AE.java)
-- [39. 组合总和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/39.%20%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8C.java)
-- [42. 接雨水](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/42.%20%E6%8E%A5%E9%9B%A8%E6%B0%B4.java)
+  - [32. 最长有效括号（dp）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/32.%20最长有效括号.java)
+  - [32. 最长有效括号（栈）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/32.%20最长有效括号（栈）.java)
+  - [32. 最长有效括号（空间O（1））](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/32.%20最长有效括号（空间O（1））.java)
+- [33. 搜索旋转排序数组](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100%/33.%20搜索旋转排序数组.java)
+- [34. 在排序数组中查找元素的第一个和最后一个位置](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/34.%20在排序数组中查找元素的第一个和最后一个位置.java)
+- [39. 组合总和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/39.%20组合总和.java)
+- [42. 接雨水](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/42.%20接雨水.java)
 - [46. 全排列](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/46.%20全排列.java)
-- [48. 旋转图像](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/48.%20%E6%97%8B%E8%BD%AC%E5%9B%BE%E5%83%8F.java)
-- [49. 字母异位词分组](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/49.%20%E5%AD%97%E6%AF%8D%E5%BC%82%E4%BD%8D%E8%AF%8D%E5%88%86%E7%BB%84.java)
-- [53. 最大子序和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/53.%20%E6%9C%80%E5%A4%A7%E5%AD%90%E5%BA%8F%E5%92%8C.java)
+- [48. 旋转图像](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/48.%20旋转图像.java)
+- [49. 字母异位词分组](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/49.%20字母异位词分组.java)
+- [53. 最大子序和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/53.%20最大子序和.java)
+- [55. 跳跃游戏](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/55.%20跳跃游戏.java)
+- [56. 合并区间](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/56.%20合并区间.java)
+- [62. 不同路径](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/62.%20不同路径.java)
+- [64. 最小路径和](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/64.%20最小路径和.java)
 
 - 94.二叉树的中序遍历
   
-  - [94. 二叉树的中序遍历](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/94.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86.java)
-  - [94. 二叉树的中序遍历（非递归，用栈）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/94.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%EF%BC%88%E9%9D%9E%E9%80%92%E5%BD%92%EF%BC%8C%E7%94%A8%E6%A0%88%EF%BC%89.java)
-  - [94. 二叉树的中序遍历（非递归，莫里斯遍历）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/94.%20%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E4%B8%AD%E5%BA%8F%E9%81%8D%E5%8E%86%EF%BC%88%E9%9D%9E%E9%80%92%E5%BD%92%EF%BC%8C%E8%8E%AB%E9%87%8C%E6%96%AF%E9%81%8D%E5%8E%86%EF%BC%89.java) 
-- [309. 最佳买卖股票时机含冷冻期](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/309.%20%E6%9C%80%E4%BD%B3%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E6%97%B6%E6%9C%BA%E5%90%AB%E5%86%B7%E5%86%BB%E6%9C%9F.java)
+  - [94. 二叉树的中序遍历](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/94.%20二叉树的中序遍历.java)
+  - [94. 二叉树的中序遍历（非递归，用栈）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/94.%20二叉树的中序遍历（非递归，用栈）.java)
+  - [94. 二叉树的中序遍历（非递归，莫里斯遍历）](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/94.%20二叉树的中序遍历（非递归，莫里斯遍历）.java) 
+- [309. 最佳买卖股票时机含冷冻期](https://github.com/Dagon0577/LeetCode/blob/master/LeetcodeTop100/309.%20最佳买卖股票时机含冷冻期.java)
   - [思路](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/solution/yi-ge-fang-fa-tuan-mie-6-dao-gu-piao-wen-ti-by-lab/)
 
 ## 力扣每日一题
 
 - [面试题13. 机器人的运动范围](https://github.com/Dagon0577/LeetCode/blob/master/力扣每日一题/面试题13.%20机器人的运动范围.java)
+- [22. 括号生成](https://github.com/Dagon0577/LeetCode/blob/master/力扣每日一题/22.%20括号生成.java)
 
 ## List
 - 📌[**Array**](https://github.com/Dagon0577/LeetCode#array)
diff --git a/Type/LeetCode_Array/Medium/918. Maximum Sum Circular Subarray.java b/Type/LeetCode_Array/Medium/918. Maximum Sum Circular Subarray.java
@@ -1,23 +1,24 @@
 class Solution {
     public int maxSubarraySumCircular(int[] A) {
-        int S = 0; // S = sum(A)
+        int S = 0;
         for (int x : A) {
             S += x;
         }
+        if (A.length == 1) {
+            return A[0];
+        }
         int ans1 = kadane(A, 0, A.length - 1, 1);
-        int ans2 = S + kadane(A, 1, A.length - 2, -1);
-        //int ans3 = S + kadane(A, 0, A.length - 2, -1);
-        return Math.max(ans1, Math.max(ans2, ans3));
+        int ans2 = S + kadane(A, 0, A.length - 2, -1);
+        // int ans3 = S + kadane(A, 0, A.length - 2, -1);
+        return Math.max(ans1, ans2);
     }
 
     public int kadane(int[] A, int i, int j, int sign) {
-        // The maximum non-empty subarray for array
-        // [sign * A[i], sign * A[i+1], ..., sign * A[j]]
         int ans = Integer.MIN_VALUE;
         int cur = Integer.MIN_VALUE;
         for (int k = i; k <= j; k++) {
             cur = sign * A[k] + Math.max(cur, 0);
-            ans = Math.max(anx, cur);
+            ans = Math.max(ans, cur);
         }
         return ans;
     }
diff --git a/力扣每日一题/22. 括号生成.java b/力扣每日一题/22. 括号生成.java
@@ -0,0 +1,21 @@
+class Solution {
+    public List<String> generateParenthesis(int n) {
+        List<String> res = new ArrayList<>();
+        backTracking(res, "", 0, 0, n);
+        return res;
+    }
+
+    private void backTracking(List<String> res, String cur, int left, int right, int n) {
+        if (cur.length() == n * 2) {
+            res.add(cur);
+            return;
+        }
+
+        if (left < n) {
+            backTracking(res, cur + '(', left + 1, right, n);
+        }
+        if (right < left) {
+            backTracking(res, cur + ')', left, right + 1, n);
+        }
+    }
+}
