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) {
if(head == nullptr || k<= 0)
return head;
int len = 1;
ListNode* pNode = head;
while(pNode->next != nullptr) {
len++;
pNode = pNode->next;
}
pNode->next = head;
k = k% len;
int p = 0;
while(p<len-k) {
p++;
pNode = pNode->next;
}
head = pNode->next;
pNode->next = nullptr;
return head;
}
};