Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
You may not alter the values in the nodes, only nodes itself may be changed.
Only constant memory is allowed.
For example,
Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2->1->4->3->5
For k = 3, you should return: 3->2->1->4->5
思路:这个题和24题很相似,是更普遍的版本。即颠倒的节点数是连续k个,k随意。
考虑用一个栈储存连续k个结点的值,在依次弹出,付给刚才的k个结点。
ListNode* reverseKGroup(ListNode* head, int k)
{
stack<int>s;
ListNode *p=head;
ListNode *q=head;
while(p)
{
int i=0;
while(p&&i<k)
{
s.push(p->val);
p=p->next;
i++;
}
if(i<k)
return head;
while(i)
{
q->val=s.top();
s.pop();
q=q->next;
i--;
}
}
return head;
}