Commit a841cfd

raof01azl397985856

authored and

committed

odd-even-linked-list: add C++ implementation (azl397985856#50)

1 parent d66730b commit a841cfdCopy full SHA for a841cfd

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -36,6 +36,10 @@ The first node is considered odd, the second node even and so on ...`
`36`	`36`	- 循环的结束条件设置为 `odd && odd.next && even && even.next`, 不应该是`odd && even`, 否则需要记录一下奇数节点的最后一个节点,复杂了操作
`37`	`37`
`38`	`38`	`## 代码`
	`39`	`+`
	`40`	`+* 语言支持:JS,C++`
	`41`	`+`
	`42`	`+JavaScript Code:`
`39`	`43`	```js
`40`	`44`	`/*`
`41`	`45`	`* @lc app=leetcode id=328 lang=javascript`
`@@ -122,3 +126,30 @@ var oddEvenList = function(head) {`
`122`	`126`	`};`
`123`	`127`	```
`124`	`128`
	`129`	`+C++ Code:`
	`130`	+```C++
	`131`	`+/**`
	`132`	`+ * Definition for singly-linked list.`
	`133`	`+ * struct ListNode {`
	`134`	`+ * int val;`
	`135`	`+ * ListNode *next;`
	`136`	`+ * ListNode(int x) : val(x), next(NULL) {}`
	`137`	`+ * };`
	`138`	`+ */`
	`139`	`+class Solution {`
	`140`	`+public:`
	`141`	`+ ListNode* oddEvenList(ListNode* head) {`
	`142`	`+ if (head == nullptr) return head;`
	`143`	`+ auto odd = head, evenHead = head->next, even = head->next;`
	`144`	`+ // 因为"每次循环之后依然保持odd在even之前",循环条件可以只判断even和even->next是否为空,修改odd和even的指向的操作也可以简化`
	`145`	`+ while (even != nullptr && even->next != nullptr) {`
	`146`	`+ odd->next = even->next;`
	`147`	`+ odd = odd->next;`
	`148`	`+ even->next = odd->next;`
	`149`	`+ even = even->next;`
	`150`	`+ }`
	`151`	`+ odd->next = evenHead;`
	`152`	`+ return head;`
	`153`	`+ }`
	`154`	`+};`
	`155`	+```

Comments

(0)