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
.
Java:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode rotateRight(ListNode head, int k) {
if(head == null|| head.next == null||k<=0) return head;
int length = 1;
ListNode node = head;
while(node.next != null)
{
node = node.next;
length++;
}
node.next = head;
int s = Math.abs(length -k%length);
while(s>1)
{
head = head.next;
s--;
}
ListNode temp = head.next;
head.next = null;
return temp;
}
}