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.

Subscribe to see which companies asked this question

public class ListNode{
		int val;
		ListNode next;
		ListNode(int x){
			val=x;
		}
	}
	public ListNode rotateRight(ListNode head, int k) {
		if(head==null){
			return head;
		}
        ListNode temp=head;
        int len=1;
        while(temp.next!=null){
        	temp=temp.next;
        	len++;
        }   
        temp.next=head;
        k=k%len;
        for(int i=0;i<len-k-1;i++){
        	head=head.next;
        }
        temp=head;
        head=head.next;
        temp.next=null;
        return head;
    }
 

public ListNode rotateRight3(ListNode head, int k) {
		if(head==null){
			return head;
		}
		ListNode tail=head;
		int len=1;
		ArrayList<ListNode> list=new ArrayList<>();
		while(tail.next!=null){
			list.add(tail);
			tail=tail.next;
			len++;
		}
		list.add(tail);
		tail.next=head;
		k=k%len;
		k=len-k-1;
		System.out.println("k="+k);
		tail=list.get(k);
		head=tail.next;
		tail.next=null;
		return head;
	}