algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #2091 from Lozakaka/patch-13

Browse Source 
新增java解法中 lambda以及linkedlist.add的註釋
This commit is contained in:
程序员Carl
2023-06-02 09:25:44 +08:00
committed by GitHub
parent 6156804822 4948ef48f4
commit 80cb527247
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
problems/0406.根据身高重建队列.md
View File

@ -191,14 +191,14 @@ class Solution {
public int[][] reconstructQueue(int[][] people) { public int[][] reconstructQueue(int[][] people) {
// 身高从大到小排（身高相同k小的站前面） // 身高从大到小排（身高相同k小的站前面）
Arrays.sort(people, (a, b) -> { Arrays.sort(people, (a, b) -> {
if (a[0] == b[0]) return a[1] - b[1]; if (a[0] == b[0]) return a[1] - b[1]; // a - b 是升序排列，故在a[0] == b[0]的狀況下，會根據k值升序排列
return b[0] - a[0]; return b[0] - a[0]; //b - a 是降序排列，在a[0] != b[0]，的狀況會根據h值降序排列
}); });
LinkedList<int[]> que = new LinkedList<>(); LinkedList<int[]> que = new LinkedList<>();
for (int[] p : people) { 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][]); return que.toArray(new int[people.length][]);