leetcode 61: Rotate List

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        ListNode* curr1=head;
        if(curr1==NULL||curr1->next==NULL)
            return head;
        int size=1;
        while(curr1->next)
        {
            curr1=curr1->next;
            size++;
        }
        k%=size;
        while(k--)
        {
            ListNode* curr2=head;
            while(curr2->next!=curr1)
                curr2=curr2->next;
            curr2->next=NULL;
            curr1->next=head;
            head=curr1;
            curr1=curr2;
        }
        return head;
    }
};