From 90d0ee1f3260a728e9c6a33ebe120f7daebd9215 Mon Sep 17 00:00:00 2001
From: X-shuffle <53906918+X-shuffle@users.noreply.github.com>
Date: Sun, 8 Aug 2021 23:08:58 +0800
Subject: [PATCH 1/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200452.=E7=94=A8?=
 =?UTF-8?q?=E6=9C=80=E5=B0=91=E6=95=B0=E9=87=8F=E7=9A=84=E7=AE=AD=E5=BC=95?=
 =?UTF-8?q?=E7=88=86=E6=B0=94=E7=90=83=20go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0452.用最少数量的箭引爆气球 go版本
---
 .../0452.用最少数量的箭引爆气球.md | 24 +++++++++++++++++++
 1 file changed, 24 insertions(+)

diff --git a/problems/0452.用最少数量的箭引爆气球.md b/problems/0452.用最少数量的箭引爆气球.md
index bb3ebbdc..a4db9e88 100644
--- a/problems/0452.用最少数量的箭引爆气球.md
+++ b/problems/0452.用最少数量的箭引爆气球.md
@@ -175,6 +175,30 @@ class Solution:
 
 Go：
 
+```golang
+func findMinArrowShots(points [][]int) int {
+    var res int =1//弓箭数
+    //先按照第一位排序
+    sort.Slice(points,func (i,j int) bool{
+        return points[i][0]<points[j][0]
+    })
+
+    for i:=1;i<len(points);i++{
+        if points[i-1][1]<points[i][0]{//如果前一位的右边界小于后一位的左边界，则一定不重合
+            res++
+        }else{
+            points[i][1] = min(points[i - 1][1], points[i][1]); // 更新重叠气球最小右边界,覆盖该位置的值，留到下一步使用
+        }
+    }
+    return res
+}
+func min(a,b int) int{
+    if a>b{
+        return b
+    }
+    return a
+}
+```
 Javascript:
 ```Javascript
 var findMinArrowShots = function(points) {

From 54733e33ac7a303f4295889589f7340913f114c2 Mon Sep 17 00:00:00 2001
From: X-shuffle <53906918+X-shuffle@users.noreply.github.com>
Date: Sun, 8 Aug 2021 23:33:31 +0800
Subject: [PATCH 2/2] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200435.=E6=97=A0?=
 =?UTF-8?q?=E9=87=8D=E5=8F=A0=E5=8C=BA=E9=97=B4=20go=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0435.无重叠区间 go版本
---
 problems/0435.无重叠区间.md | 24 +++++++++++++++++++++++-
 1 file changed, 23 insertions(+), 1 deletion(-)

diff --git a/problems/0435.无重叠区间.md b/problems/0435.无重叠区间.md
index d32c2ebb..b86f6714 100644
--- a/problems/0435.无重叠区间.md
+++ b/problems/0435.无重叠区间.md
@@ -250,7 +250,29 @@ class Solution:
 ```
 
 Go：
-
+```golang
+func eraseOverlapIntervals(intervals [][]int) int {
+    var flag int
+    //先排序
+    sort.Slice(intervals,func(i,j int)bool{
+        return intervals[i][0]<intervals[j][0]
+    })
+    fmt.Println(intervals)
+    for i:=1;i<len(intervals);i++{
+        if intervals[i-1][1]>intervals[i][0]{
+            flag++
+            intervals[i][1]=min(intervals[i-1][1],intervals[i][1])//由于是先排序的，所以，第一位是递增顺序，故只需要将临近两个元素的第二个值最小值更新到该元素的第二个值即可作之后的判断
+        }
+    }
+    return flag
+}
+func min(a,b int)int{
+    if a>b{
+        return b
+    }
+    return a
+}
+```
 Javascript:
 ```Javascript
 var eraseOverlapIntervals = function(intervals) {