这个题是把链表进行重新排序,先把奇数节点放在一起,再把偶数节点放在一起。
需要注意: odd_node->next = NULL 要写上,否则会出现错误
**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* oddEvenList(ListNode* head) {
ListNode* even_dummy = new ListNode(0);
ListNode* even_node = even_dummy;
ListNode* odd_dummy = new ListNode(0);
ListNode* odd_node = odd_dummy;
int num = 0;
while (head != NULL) {
if (num % 2 == 0) {
even_node->next = head;
even_node = even_node->next;
}
else {
odd_node->next = head;
odd_node = odd_node->next;
}
head = head->next;
num++;
}
odd_node->next = NULL;
even_node->next = odd_dummy->next;
return even_dummy->next;
}
};