二刷406

Author: diguage

docs/0000-27-greedy.adoc

@@ -25,6 +25,7 @@ image::images/greedy-01.png[{image_attr}]
 . xref:0376-wiggle-subsequence.adoc[376. Wiggle Subsequence]
 . xref:0397-integer-replacement.adoc[397. Integer Replacement]
 . xref:0402-remove-k-digits.adoc[402. Remove K Digits]
+. xref:0406-queue-reconstruction-by-height.adoc[406. Queue Reconstruction by Height]
 . xref:0409-longest-palindrome.adoc[409. Longest Palindrome]
 . xref:0410-split-array-largest-sum.adoc[410. Split Array Largest Sum]
 . xref:0420-strong-password-checker.adoc[420. Strong Password Checker]

docs/0406-queue-reconstruction-by-height.adoc

@@ -1,56 +1,91 @@
 [#0406-queue-reconstruction-by-height]
-= 406. Queue Reconstruction by Height
+= 406. 根据身高重建队列
 
-{leetcode}/problems/queue-reconstruction-by-height/[LeetCode - Queue Reconstruction by Height^]
+https://leetcode.cn/problems/queue-reconstruction-by-height/[LeetCode - 406. 根据身高重建队列 ^]
 
-Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers `(h, k)`, where `h` is the height of the person and `k` is the number of people in front of this person who have a height greater than or equal to `h`. Write an algorithm to reconstruct the queue.
+假设有打乱顺序的一群人站成一个队列，数组 `people` 表示队列中一些人的属性（不一定按顺序）。每个 `people[i] = [h~i~, k~i~]` 表示第 `i` 个人的身高为 `h~i~` ，前面 *正好* 有 `k~i~` 个身高大于或等于 `h~i~` 的人。
 
-*Note:*
+请你重新构造并返回输入数组 `people` 所表示的队列。返回的队列应该格式化为数组 `queue` ，其中 `queue[j] = [h~j~, k~j~]` 是队列中第 `j` 个人的属性（`queue[0]` 是排在队列前面的人）。
 
-The number of people is less than 1,100.
+*示例 1：*
 
+....
+输入：people = [[7,0],[4,4],[7,1],[5,0],[6,1],[5,2]]
+输出：[[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]]
+解释：
+编号为 0 的人身高为 5 ，没有身高更高或者相同的人排在他前面。
+编号为 1 的人身高为 7 ，没有身高更高或者相同的人排在他前面。
+编号为 2 的人身高为 5 ，有 2 个身高更高或者相同的人排在他前面，即编号为 0 和 1 的人。
+编号为 3 的人身高为 6 ，有 1 个身高更高或者相同的人排在他前面，即编号为 1 的人。
+编号为 4 的人身高为 4 ，有 4 个身高更高或者相同的人排在他前面，即编号为 0、1、2、3 的人。
+编号为 5 的人身高为 7 ，有 1 个身高更高或者相同的人排在他前面，即编号为 1 的人。
+因此 [[5,0],[7,0],[5,2],[6,1],[4,4],[7,1]] 是重新构造后的队列。
+....
 
-.Example
-----
-Input:
-[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
+*示例 2：*
 
-Output:
-[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
-----
+....
+输入：people = [[6,0],[5,0],[4,0],[3,2],[2,2],[1,4]]
+输出：[[4,0],[5,0],[2,2],[3,2],[1,4],[6,0]]
+....
 
-这道题有点不明觉厉。
 
-== 参考资料
+*提示：*
 
-. https://leetcode-cn.com/problems/queue-reconstruction-by-height/solution/gen-ju-shen-gao-zhong-jian-dui-lie-by-leetcode/[根据身高重建队列 - 根据身高重建队列 - 力扣（LeetCode）^]
+* `+1 <= people.length <= 2000+`
+* `0 \<= h~i~ \<= 10^6^`
+* `0 \<= k~i~ < people.length`
+* 题目数据确保队列可以被重建
 
-Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers `(h, k)`, where `h` is the height of the person and `k` is the number of people in front of this person who have a height greater than or equal to `h`. Write an algorithm to reconstruct the queue.
 
-*Note:*
+== 思路分析
 
+套路：一般这种数对，还涉及排序的，根据第一个元素正向排序，根据第二个元素反向排序，或者根据第一个元素反向排序，根据第二个元素正向排序，往往能够简化解题过程。
 
-The number of people is less than 1,100.
- 
+image::images/0406-10.png[{image_attr}]
 
-*Example*
+image::images/0406-11.png[{image_attr}]
 
-[subs="verbatim,quotes,macros"]
-----
-Input:
-[[7,0], [4,4], [7,1], [5,0], [6,1], [5,2]]
+image::images/0406-12.png[{image_attr}]
 
-Output:
-[[5,0], [7,0], [5,2], [6,1], [4,4], [7,1]]
-----
+image::images/0406-13.png[{image_attr}]
+
+image::images/0406-14.png[{image_attr}]
+
+image::images/0406-15.png[{image_attr}]
+
+image::images/0406-16.png[{image_attr}]
 
- 
+image::images/0406-17.png[{image_attr}]
 
+image::images/0406-18.png[{image_attr}]
 
 
 [[src-0406]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0406_QueueReconstructionByHeight.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0406_QueueReconstructionByHeight_2.java[tag=answer]
+----
+--
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/queue-reconstruction-by-height/solutions/486493/xian-pai-xu-zai-cha-dui-dong-hua-yan-shi-suan-fa-g/?envType=problem-list-v2&envId=9UZ9R3lB[406. 根据身高重建队列 - 【先排序，再插队】动画演示算法过程，有点小套路^]
+. https://leetcode.cn/problems/queue-reconstruction-by-height/solutions/486337/406du-shuo-shi-tan-xin-na-yao-wei-shi-yao-yong-tan/?envType=problem-list-v2&envId=9UZ9R3lB[406. 根据身高重建队列 - 「代码随想录」带你学透贪心算法！^]
+. https://leetcode.cn/problems/queue-reconstruction-by-height/solutions/486066/gen-ju-shen-gao-zhong-jian-dui-lie-by-leetcode-sol/?envType=problem-list-v2&envId=9UZ9R3lB[406. 根据身高重建队列 - 官方题解^]