【leetcode】328. Odd Even Linked List

328. Odd Even Linked List

https://leetcode.com/problems/odd-even-linked-list/?tab=Description
链表是弱项，要多训练。

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:
Given 1->2->3->4->5->NULL,
return 1->3->5->2->4->NULL.

Note:
The relative order inside both the even and odd groups should remain as it was in the input.
The first node is considered odd, the second node even and so on …

思路

用两个指针一起遍历链表，每次遍历两个节点（奇数节点和偶数节点），然后再将偶数链表的头接在奇数链表的尾后。
思路是很简单，但是一定要注意细节。链表题因为指针较多，有时候容易混淆，多声明几个也没有关系，一定要将指针变换的过程整理清楚。

代码

c++和java的都摘上来

c++

def oddEvenList(self, head):
       if head == None or head.next == None or head.next.next == None:#少于三个节点的，都只需直接返回head
           return head

       evenHead = head.next#标记偶节点指针的头
       curOdd = head#标记奇节点的当前节点
       curEven = evenHead#标记...
       cur = evenHead.next

       while cur != None:
           curOdd.next = cur
           curOdd = cur
           cur = cur.next

       if cur != None:#这里一定要判断哟
           curEven.next = cur
           curEven = cur
           cur = cur.next

       curOdd.next = evenHead
       curEven.next = None#这里一定要记得置空

       return head

java

public ListNode oddEvenList(ListNode head) {
    if(head==null||head.next==null) return head;
    ListNode odd=head,ehead=head.next,even=ehead;
    while(even!=null&&even.next!=null){
        odd.next=even.next;
        odd=odd.next;
        even.next=odd.next;
        even=even.next;
    }
    odd.next=ehead;
    return head;
}