From f9146a3b98fd46ca548c8852bf3b7df0625cfe72 Mon Sep 17 00:00:00 2001
From: zhenghao <1650937065@qq.com>
Date: Wed, 20 Apr 2022 10:23:18 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B00435=20=E6=97=A0=E9=87=8D?=
 =?UTF-8?q?=E5=8F=A0=E5=8C=BA=E9=97=B4=20java=E7=89=88=E6=9C=AC=E5=8F=B3?=
 =?UTF-8?q?=E8=BE=B9=E7=95=8C=E8=A7=A3=E6=B3=95=E4=B8=AD=E6=8E=92=E5=BA=8F?=
 =?UTF-8?q?=E7=9A=84=E5=88=A4=E6=96=AD=E9=80=BB=E8=BE=91?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0435.无重叠区间.md | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/problems/0435.无重叠区间.md b/problems/0435.无重叠区间.md
index b24ca024..cf58b9e2 100644
--- a/problems/0435.无重叠区间.md
+++ b/problems/0435.无重叠区间.md
@@ -184,13 +184,14 @@ public:
 class Solution {
     public int eraseOverlapIntervals(int[][] intervals) {
         Arrays.sort(intervals, (a, b) -> {
-            if (a[0] == a[0]) return a[1] - b[1];
-            return a[0] - b[0];
+            // 按照区间右边界升序排序
+            return a[1] - b[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 {