Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL
and k = 2
,
return 4->5->1->2->3->NULL
.
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *rotateRight(ListNode *head, int k) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (head == NULL) {
return head;
}
ListNode* p = head;
ListNode* t = head;
int count = 0;
while (p->next || count < k) {
if (count < k ) {
if (p->next) {
p = p->next;
} else {
p = head;
}
++count;
continue;
}
p = p->next;
t = t->next;
}
p->next = head;
head = t->next;
t->next = NULL;
return head;
}
};