Commit 4948ef4

authored

新增java解法中 lambda以及linkedlist.add的註釋

1 parent b8cb004 commit 4948ef4Copy full SHA for 4948ef4

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -191,14 +191,14 @@ class Solution {`
`191`	`191`	`public int[][] reconstructQueue(int[][] people) {`
`192`	`192`	`// 身高从大到小排(身高相同k小的站前面)`
`193`	`193`	`Arrays.sort(people, (a, b) -> {`
`194`		`- if (a[0] == b[0]) return a[1] - b[1];`
`195`		`- return b[0] - a[0];`
	`194`	`+ if (a[0] == b[0]) return a[1] - b[1];// a - b 是升序排列,故在a[0] == b[0]的狀況下,會根據k值升序排列`
	`195`	`+ return b[0] - a[0];//b - a 是降序排列,在a[0] != b[0],的狀況會根據h值降序排列`
`196`	`196`	`});`
`197`	`197`
`198`	`198`	`LinkedList<int[]> que = new LinkedList<>();`
`199`	`199`
`200`	`200`	`for (int[] p : people) {`
`201`		`- que.add(p[1],p);`
	`201`	`+ que.add(p[1],p);//Linkedlist.add(index, value),會將value插入到指定index裡。`
`202`	`202`	`}`
`203`	`203`
`204`	`204`	`return que.toArray(new int[people.length][]);`

Comments

(0)