Rotate List

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.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode rotateRight(ListNode head, int n) {
		// Start typing your Java solution below
		// DO NOT write main() function
		if (head == null || n == 0)
			return head;
		ListNode node = head;
		int counter = 1;
		while (node.next != null) {
			node = node.next;
			counter++;
		}
		n = n % counter;
		if (n == 0)
			return head;
		int step = counter - n;
		node.next = head;// connect tail to head, makes it a circle
		node = head;
		while (step > 1) {
			step--;
			node = node.next;
		}
		head = node.next;
		node.next = null;
		return head;
	}
}