是的我又回来啦!经历了计算机网络与操作系统双重考验的我又回来接着苦逼的刷LeetCode啦
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 ...
你应当在给定的链表中完成(即不另外新建单链表),程序应该只有O(1)的空间复杂度和O(n)的时间复杂度。
例如:
给定1->2->3->4->5->NULL
应当返回1->3->5->2->4->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) {
if(!head||!head->next||!head->next->next) return head;
ListNode *even_head=head->next;
ListNode *temp1=head,*temp2=even_head;
ListNode *temp=head->next->next;
int flag=1;
while(temp->next)
{
if(flag==1){
temp1->next=temp;
temp1=temp1->next;
}
else{
temp2->next=temp;
temp2=temp2->next;
}
temp=temp->next;
flag^=1;
}
if(flag==1){
temp1->next=temp;
temp1=temp1->next;
}
else{
temp2->next=temp;
temp2=temp2->next;
}
temp2->next=NULL;
temp1->next=even_head;
return head;
}
};
希望自己要加油