rotate Linkedlist

gistfile1.txt

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

Node* rotateNode(Node* head, int k) {
 if( k<= 0) return head;
 
 Node* first = kth = head;
 Node* end = head;

 for(int i=0; i<k+1; i++) kth = kth->next;    
 
 
 while(kth != NULL) {
     end = first;
     first = first->next;
     kth = kth->next;
 }
 
 end->next = NULL;
 kth->next = head;
 
 return first;
}