题目:
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.
思路:
比较简单,直接设置两个头结点——odd头结点和even头结点,分别把各个节点挂上去即可。
代码实现:
submit一次就过了。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
if (head == nullptr){
return nullptr;
}
ListNode *odd_superhead = new ListNode();
ListNode *even_superhead = new ListNode();
ListNode *odd_p = odd_superhead;
ListNode *even_p = even_superhead;
ListNode *p = head;
bool isOdd = true;
while (p){
if (isOdd){
odd_p->next = p;
odd_p = odd_p->next;
}else{
even_p->next = p;
even_p = even_p->next;
}
p = p->next;
isOdd = 1 - isOdd;
}
odd_p->next = even_superhead->next;
even_p->next = nullptr;
return odd_superhead->next;
}
};
discuss:
// 思路:设置两个指针odd和even,分别指向第一个node和第二个node。然后不断地将odd->next指向odd->next->next(even也一样)即可。
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
if (!head) return head;
ListNode *odd = head, *evenhead = head->next, *even = evenhead;
while (even && even->next){ // 因为even更靠后一点,所以用even判断是否结尾
odd->next = odd->next->next;
even->next = even->next->next;
odd = odd->next;
even = even->next;
}
odd->next = evenhead;
return head;
}
};