LeetCode #61 - Rotate List

题目描述：

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

Example 1:

Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL

Example 2:

Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL

Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

指定旋转步数，将链表末尾元素旋转至表头。其实只需要遍历到链表倒数第k个节点，将链表断开，把前一段链表接入到后一段链表后面即可。

class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(head==NULL) return head;
        ListNode* p=head;
        ListNode* end=NULL;
        int length=0;
        while(p!=NULL)
        {
            end=p;
            p=p->next;
            length++;
        }
        k%=length;
        if(k==0) return head;
        
        p=head;
        ListNode* pre=NULL;
        for(int i=0;i<(length-k);i++)
        {
            pre=p;
            p=p->next;
        }
        end->next=head;
        pre->next=NULL;
        return p;
    }
};