1.4 KiB
1.4 KiB
layout, title, last_solved, category, leetcode_url, status
| layout | title | last_solved | category | leetcode_url | status |
|---|---|---|---|---|---|
| page | Odd Even Linked List | 2020-07-21 | linked list | https://leetcode.com/problems/odd-even-linked-list | Attempted |
Problem
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.
Example 1:
Input: 1->2->3->4->5->NULL
Output: 1->3->5->2->4->NULL
Example 2:
Input: 2->1->3->5->6->4->7->NULL
Output: 2->3->6->7->1->5->4->NULL
Solution
Explained in Nick White's video
- Build even list and odd list seperately
- Join end of odd list to head of even list
{% highlight python %}
def oddEvenList(self, head: ListNode) -> ListNode:
if not head: return None
odd = head
even = head.next
evenHead = even
while even and even.next:
odd.next = even.next # make odd jump over "even"
odd = odd.next # move odd to next
even.next = odd.next # make even jump over
even = even.next # move even to next
odd.next = evenHead
return head
{% endhighlight %}