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
.
“
Let's start with an example.
Given [0,1,2]
, rotate 1 steps to the right -> [2,0,1]
.
Given [0,1,2]
, rotate 2 steps to the right -> [1,2,0]
.
Given [0,1,2]
, rotate 3 steps to the right -> [0,1,2]
.
Given [0,1,2]
, rotate 4 steps to the right -> [2,0,1]
.
So, no matter how big K, the number of steps is, the result is always the same as rotating K % n
steps to the right.”
/**
* 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 || k == 0) return head;
ListNode *p, *q, *tmp;;
int i = 0;
q = head, p = head;
while (i<k && q){
q=q->next;
i++;
if(!q&&i<=k){
k%=i;i=0;q=head;
if(k==0)return head;
}
}
while (q->next){
p = p->next;
q = q->next;
}
tmp = p->next;
p->next = NULL;
q->next = head;
return tmp;
}
};