From 4948ef48f46d516a475f8bf57ab559b5a71513af Mon Sep 17 00:00:00 2001
From: Lozakaka <102352821+Lozakaka@users.noreply.github.com>
Date: Wed, 17 May 2023 16:50:29 -0400
Subject: [PATCH] =?UTF-8?q?=E6=96=B0=E5=A2=9Ejava=E8=A7=A3=E6=B3=95?=
 =?UTF-8?q?=E4=B8=AD=20lambda=E4=BB=A5=E5=8F=8Alinkedlist.add=E7=9A=84?=
 =?UTF-8?q?=E8=A8=BB=E9=87=8B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

新增java解法中 lambda以及linkedlist.add的註釋
---
 problems/0406.根据身高重建队列.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/problems/0406.根据身高重建队列.md b/problems/0406.根据身高重建队列.md
index 3f82d0bc..67aef3ec 100644
--- a/problems/0406.根据身高重建队列.md
+++ b/problems/0406.根据身高重建队列.md
@@ -191,14 +191,14 @@ class Solution {
     public int[][] reconstructQueue(int[][] people) {
         // 身高从大到小排（身高相同k小的站前面）
         Arrays.sort(people, (a, b) -> {
-            if (a[0] == b[0]) return a[1] - b[1];
-            return b[0] - a[0];
+            if (a[0] == b[0]) return a[1] - b[1];   // a - b 是升序排列，故在a[0] == b[0]的狀況下，會根據k值升序排列
+            return b[0] - a[0];   //b - a 是降序排列，在a[0] != b[0]，的狀況會根據h值降序排列
         });
 
         LinkedList<int[]> que = new LinkedList<>();
 
         for (int[] p : people) {
-            que.add(p[1],p);
+            que.add(p[1],p);   //Linkedlist.add(index, value)，會將value插入到指定index裡。
         }
 
         return que.toArray(new int[people.length][]);