From 3d61b13f9d7b0178aa66f4e352a27dc0ea51c61a Mon Sep 17 00:00:00 2001
From: baici1 <249337001@qq.com>
Date: Thu, 23 Sep 2021 14:56:20 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0406.=20=E6=A0=B9=E6=8D=AE?=
 =?UTF-8?q?=E8=BA=AB=E9=AB=98=E9=87=8D=E5=BB=BA=E9=98=9F=E5=88=97=20go?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC=20=E9=93=BE=E8=A1=A8=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0406.根据身高重建队列.md | 33 ++++++++++++++++++++++-
 1 file changed, 32 insertions(+), 1 deletion(-)

diff --git a/problems/0406.根据身高重建队列.md b/problems/0406.根据身高重建队列.md
index bd27b1b2..3c6ee63c 100644
--- a/problems/0406.根据身高重建队列.md
+++ b/problems/0406.根据身高重建队列.md
@@ -222,7 +222,7 @@ class Solution:
 ```
 
 Go：
-```golang
+```go
 func reconstructQueue(people [][]int) [][]int {
     //先将身高从大到小排序，确定最大个子的相对位置
     sort.Slice(people,func(i,j int)bool{
@@ -241,7 +241,38 @@ func reconstructQueue(people [][]int) [][]int {
 	return result
 }
 ```
+```go
+//链表法
+func reconstructQueue(people [][]int) [][]int {
+     sort.Slice(people,func (i,j int) bool {
+        if people[i][0]==people[j][0]{
+            return people[i][1]<people[j][1]//当身高相同时，将K按照从小到大排序
+        }
+         //先将身高从大到小排序，确定最大个子的相对位置
+        return people[i][0]>people[j][0]
+    })
+    l:=list.New()//创建链表
+    for i:=0;i<len(people);i++{
+        position:=people[i][1]
+        mark:=l.PushBack(people[i])//插入元素
+        e:=l.Front()
+        for position!=0{//获取相对位置
+            position--
+            e=e.Next()
+        }
+        l.MoveBefore(mark,e)//移动位置
+        
+    }
+    res:=[][]int{}
+    for e:=l.Front();e!=nil;e=e.Next(){
+        res=append(res,e.Value.([]int))
+    }
+    return res
+}
+```
+
 Javascript:
+
 ```Javascript
 var reconstructQueue = function(people) {
     let queue = []