From a1a875f6db94728fbad5a3529a7aececce8504b8 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Wed, 12 May 2021 21:01:01 +0800
Subject: [PATCH 1/4] =?UTF-8?q?Update=200226.=E7=BF=BB=E8=BD=AC=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0226.翻转二叉树.md | 15 ++++++++++++++-
 1 file changed, 14 insertions(+), 1 deletion(-)

diff --git a/problems/0226.翻转二叉树.md b/problems/0226.翻转二叉树.md
index afc1f144..ec1335c6 100644
--- a/problems/0226.翻转二叉树.md
+++ b/problems/0226.翻转二叉树.md
@@ -208,8 +208,21 @@ Java：
 Python：
 
 
-Go：
+```Go
+func invertTree(root *TreeNode) *TreeNode {
+    if root ==nil{
+        return nil
+    }
+    temp:=root.Left
+    root.Left=root.Right
+    root.Right=temp
+    
+    invertTree(root.Left)
+    invertTree(root.Right)
 
+    return root
+}
+```
 
 
 

From 8314c1cf082f83de674f7e2779eba8fe74972422 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Thu, 13 May 2021 09:03:10 +0800
Subject: [PATCH 2/4] =?UTF-8?q?Update=200019.=E5=88=A0=E9=99=A4=E9=93=BE?=
 =?UTF-8?q?=E8=A1=A8=E7=9A=84=E5=80=92=E6=95=B0=E7=AC=ACN=E4=B8=AA?=
 =?UTF-8?q?=E8=8A=82=E7=82=B9.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0019.删除链表的倒数第N个节点.md | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/0019.删除链表的倒数第N个节点.md b/problems/0019.删除链表的倒数第N个节点.md
index 3b6dde1e..3b89dabd 100644
--- a/problems/0019.删除链表的倒数第N个节点.md
+++ b/problems/0019.删除链表的倒数第N个节点.md
@@ -112,7 +112,28 @@ class Solution {
     }
 }
 ```
+Go:
+```Go
+func removeNthFromEnd(head *ListNode, n int) *ListNode {
+    result:=&ListNode{}
+    result.Next=head
+    var pre *ListNode
+    cur:=result
 
+    i:=1
+    for head!=nil{
+        if i>=n{
+            pre=cur
+            cur=cur.Next
+        }
+        head=head.Next
+        i++
+    }
+    pre.Next=pre.Next.Next
+    return result.Next
+
+}
+```
 
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)

From bff058e3c07dbc55a8110fbd08cbeaba24b8d0d3 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Thu, 13 May 2021 09:24:19 +0800
Subject: [PATCH 3/4] =?UTF-8?q?Update=200015.=E4=B8=89=E6=95=B0=E4=B9=8B?=
 =?UTF-8?q?=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0015.三数之和.md | 34 ++++++++++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)

diff --git a/problems/0015.三数之和.md b/problems/0015.三数之和.md
index 55e22887..96dc1ac3 100644
--- a/problems/0015.三数之和.md
+++ b/problems/0015.三数之和.md
@@ -221,6 +221,40 @@ Python：
 
 
 Go：
+```Go
+func threeSum(nums []int)[][]int{
+	sort.Ints(nums)
+	res:=[][]int{}
+	
+	for i:=0;i<len(nums)-2;i++{
+		n1:=nums[i]
+		if n1>0{
+			break
+		}
+		if i>0&&n1==nums[i-1]{
+			continue
+		}
+		l,r:=i+1,len(nums)-1
+		for l<r{
+			n2,n3:=nums[l],nums[r]
+			if n1+n2+n3==0{
+				res=append(res,[]int{n1,n2,n3})
+				for l<r&&nums[l]==n2{
+					l++
+				}
+				for l<r&&nums[r]==n3{
+					r--
+				}
+			}else if n1+n2+n3<0{
+				l++
+			}else {
+				r--
+			}
+		}
+	}
+	return res
+}
+```
 
 
 

From 9419ca2a15e2ad67db3182c1315207a5ba543795 Mon Sep 17 00:00:00 2001
From: QuinnDK <39618652+QuinnDK@users.noreply.github.com>
Date: Thu, 13 May 2021 09:32:54 +0800
Subject: [PATCH 4/4] =?UTF-8?q?Update=200198.=E6=89=93=E5=AE=B6=E5=8A=AB?=
 =?UTF-8?q?=E8=88=8D.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0198.打家劫舍.md | 27 +++++++++++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/problems/0198.打家劫舍.md b/problems/0198.打家劫舍.md
index b9ccec45..c64648ad 100644
--- a/problems/0198.打家劫舍.md
+++ b/problems/0198.打家劫舍.md
@@ -117,6 +117,33 @@ Python：
 
 
 Go：
+```Go
+func rob(nums []int) int {
+	if len(nums)<1{
+		return 0
+	}
+	if len(nums)==1{
+		return nums[0]
+	}
+	if len(nums)==2{
+		return max(nums[0],nums[1])
+	}
+	dp :=make([]int,len(nums))
+	dp[0]=nums[0]
+	dp[1]=max(nums[0],nums[1])
+	for i:=2;i<len(nums);i++{
+		dp[i]=max(dp[i-2]+nums[i],dp[i-1])
+	}
+	return dp[len(dp)-1]
+}
+
+func max(a, b int) int {
+	if a>b{
+		return a
+	}
+	return b
+}
+```