61. Rotate List

Given a list, rotate the list to the right by k places, where k is non-negative.

Example:

Given 1->2->3->4->5->NULL and k = 2,

return 4->5->1->2->3->NULL.

class Solution {
    public ListNode rotateRight(ListNode head, int k) {
        if(head == null || k == 0){
            return head;
        }
        ListNode p = head;
        p = head;    
        int count = 1;
        while(p.next != null){
            count++;
            p = p.next;
        }
        p.next = head;
        k = k % count;
        for(int i = 0; i < count - k; i++){
            p = p.next;
        }
        head = p.next;
        p.next = null;
        
        
        return head;
        
        
    }
}