61. Rotate List LeetCode

题意：给出一个链表，还有向右移动的步数k，问移动后的链表。
题解：k可能大于链表长度，所以%一下。然后问题转换成把前面n-k个节点移动到链表后面。

/**
 * 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) {
        int num = 1;
        if(head == NULL || head->next == NULL) return head;
        ListNode* root = head,*ans = new ListNode(0);
        ans->next = head;
        while(root->next)
        {
            root = root->next;
            num++;
        }
        k = k % num;
        k = num - k;
        while(k--)
        {
            ListNode* pre = ans->next;
            ans->next = pre->next;
            root->next = pre;
            pre->next = NULL;
            root = root->next;
        }
        return ans->next;
    }
};