Commit 77d3469

authored

改进 0143 重排链表

在使用数组存储链表节点的写法中,最后再判断数组长度为偶数时时没有必要的,因为在循环体while里面,我们用的是 i<=j。

1 parent f88678d commit 77d3469Copy full SHA for 77d3469

File tree

-15

lines changed

-15

lines changed

Lines changed: 0 additions & 15 deletions

Original file line number	Diff line number	Diff line change
`@@ -50,10 +50,6 @@ public:`
`50`	`50`	`cur = cur->next;`
`51`	`51`	`count++;`
`52`	`52`	`}`
`53`		`- if (vec.size() % 2 == 0) { // 如果是偶数,还要多处理中间的一个`
`54`		`- cur->next = vec[i];`
`55`		`- cur = cur->next;`
`56`		`- }`
`57`	`53`	`cur->next = nullptr; // 注意结尾`
`58`	`54`	`}`
`59`	`55`	`};`
`@@ -249,12 +245,6 @@ public class ReorderList {`
`249`	`245`	`cur = cur.next;`
`250`	`246`	`count++;`
`251`	`247`	`}`
`252`		`- // 当是偶数的话,需要做额外处理`
`253`		`- if (list.size() % 2== 0){`
`254`		`- cur.next = list.get(l);`
`255`		`- cur = cur.next;`
`256`		`- }`
`257`		`-`
`258`	`248`	`// 注意结尾要结束一波`
`259`	`249`	`cur.next = null;`
`260`	`250`	`}`
`@@ -376,11 +366,6 @@ var reorderList = function(head, s = [], tmp) {`
`376`	`366`	`cur = cur.next;`
`377`	`367`	`count++;`
`378`	`368`	`}`
`379`		`- // 当是偶数的话,需要做额外处理`
`380`		`- if(list.length % 2 == 0){`
`381`		`- cur.next = list[l];`
`382`		`- cur = cur.next;`
`383`		`- }`
`384`	`369`	`// 注意结尾要结束一波`
`385`	`370`	`cur.next = null;`
`386`	`371`	`}`

Comments

(0)