From b3078ef51c321e386f5900e4f43c3b2c68dd0ca0 Mon Sep 17 00:00:00 2001
From: zhicheng lee <904688436@qq.com>
Date: Sun, 23 Jan 2022 22:59:59 +0800
Subject: [PATCH 1/2] =?UTF-8?q?Update=200435.=E6=97=A0=E9=87=8D=E5=8F=A0?=
 =?UTF-8?q?=E5=8C=BA=E9=97=B4.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

更新Java版本代码
---
 problems/0435.无重叠区间.md | 28 +++++++++++-----------------
 1 file changed, 11 insertions(+), 17 deletions(-)

diff --git a/problems/0435.无重叠区间.md b/problems/0435.无重叠区间.md
index 118360bc..389443d1 100644
--- a/problems/0435.无重叠区间.md
+++ b/problems/0435.无重叠区间.md
@@ -183,28 +183,22 @@ public:
 ```java
 class Solution {
     public int eraseOverlapIntervals(int[][] intervals) {
-        if (intervals.length < 2) return 0;
-
-        Arrays.sort(intervals, new Comparator<int[]>() {
-            @Override
-            public int compare(int[] o1, int[] o2) {
-                if (o1[1] != o2[1]) {
-                    return Integer.compare(o1[1],o2[1]);
-                } else {
-                    return Integer.compare(o1[0],o2[0]);
-                }
-            }
+        Arrays.sort(intervals, (a, b) -> {
+            if (a[0] == a[0]) return a[1] - b[1];
+            return a[0] - b[0];
         });
 
-        int count = 1;
-        int edge = intervals[0][1];
-        for (int i = 1; i < intervals.length; i++) {
-            if (edge <= intervals[i][0]){
-                count ++; //non overlap + 1
+        int count = 0;
+        int edge = Integer.MIN_VALUE;
+        for (int i = 0; i < intervals.length; i++) {
+            if (edge <= intervals[i][0]) {
                 edge = intervals[i][1];
+            } else {
+                count++;
             }
         }
-        return intervals.length - count;
+
+        return count;
     }
 }
 ```

From 067f71cdf03858645ba70c5151a1d26f16d91928 Mon Sep 17 00:00:00 2001
From: zhicheng lee <904688436@qq.com>
Date: Mon, 31 Jan 2022 11:54:59 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20=E8=83=8C=E5=8C=85?=
 =?UTF-8?q?=E9=97=AE=E9=A2=98=E7=90=86=E8=AE=BA=E5=9F=BA=E7=A1=80=E5=AE=8C?=
 =?UTF-8?q?=E5=85=A8=E8=83=8C=E5=8C=85.md=20Java=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加注释，去掉一个不必要的if语句
---
 problems/背包问题理论基础完全背包.md | 12 +++++-------
 1 file changed, 5 insertions(+), 7 deletions(-)

diff --git a/problems/背包问题理论基础完全背包.md b/problems/背包问题理论基础完全背包.md
index f79310b8..cea69c72 100644
--- a/problems/背包问题理论基础完全背包.md
+++ b/problems/背包问题理论基础完全背包.md
@@ -183,11 +183,9 @@ private static void testCompletePack(){
     int[] value = {15, 20, 30};
     int bagWeight = 4;
     int[] dp = new int[bagWeight + 1];
-    for (int i = 0; i < weight.length; i++){
-        for (int j = 1; j <= bagWeight; j++){
-            if (j - weight[i] >= 0){
-                dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
-            }
+    for (int i = 0; i < weight.length; i++){ // 遍历物品
+        for (int j = weight[i]; j <= bagWeight; j++){ // 遍历背包容量
+            dp[j] = Math.max(dp[j], dp[j - weight[i]] + value[i]);
         }
     }
     for (int maxValue : dp){
@@ -201,8 +199,8 @@ private static void testCompletePackAnotherWay(){
     int[] value = {15, 20, 30};
     int bagWeight = 4;
     int[] dp = new int[bagWeight + 1];
-    for (int i = 1; i <= bagWeight; i++){
-        for (int j = 0; j < weight.length; j++){
+    for (int i = 1; i <= bagWeight; i++){ // 遍历背包容量
+        for (int j = 0; j < weight.length; j++){ // 遍历物品
             if (i - weight[j] >= 0){
                 dp[i] = Math.max(dp[i], dp[i - weight[j]] + value[j]);
             }