Commit 7625e13

committed

Feat: 328

1 parent 922ddd5 commit 7625e13Copy full SHA for 7625e13

File tree

+42

-0

lines changed

+42

-0

lines changed

Lines changed: 42 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,42 @@`
	`1`	`+## 题目`
	`2`	`+`
	`3`	`+* 328. 奇偶链表`
	`4`	`+`
	`5`	`+给定一个单链表,把所有的奇数节点和偶数节点分别排在一起。请注意,这里的奇数节点和偶数节点指的是节点编号的奇偶性,而不是节点的值的奇偶性。`
	`6`	`+`
	`7`	`+请尝试使用原地算法完成。你的算法的空间复杂度应为 O(1),时间复杂度应为 O(nodes),nodes 为节点总数。`
	`8`	`+`
	`9`	`+## 思路`
	`10`	`+`
	`11`	`+## 代码`
	`12`	`+`
	`13`	+```php
	`14`	`+`
	`15`	`+class Solution {`
	`16`	`+`
	`17`	`+ /**`
	`18`	`+ * @param ListNode $head`
	`19`	`+ * @return ListNode`
	`20`	`+ */`
	`21`	`+ function oddEvenList($head) {`
	`22`	`+ if (!$head \|\| !$head->next \|\| !$head->next->next) {`
	`23`	`+ return $head;`
	`24`	`+ }`
	`25`	`+`
	`26`	`+ $oddLast = $head;`
	`27`	`+ $evenHead = $head->next;`
	`28`	`+ $eventLast = $head->next;`
	`29`	`+`
	`30`	`+ while ($oddLast->next && $eventLast->next) {`
	`31`	`+ $oddLast->next = $oddLast->next->next;`
	`32`	`+ $eventLast->next = $eventLast->next->next;`
	`33`	`+ $oddLast = $oddLast->next;`
	`34`	`+ $eventLast = $eventLast->next;`
	`35`	`+ }`
	`36`	`+`
	`37`	`+ $oddLast->next = $evenHead;`
	`38`	`+ return $head;`
	`39`	`+ }`
	`40`	`+}`
	`41`	`+`
	`42`	+```

Comments

(0)