leetcode61

1、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.
向右旋转k位，为避免k太大超时，先遍历求长度length，取余。
首先首尾相连成环状，简单推一下发现向右旋转k位，等同于第length-k的next位成为head（当k为0时也相当于第一位，毕竟是个环嘛），然后将第length-k位的next置为空。

/**
 * 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) {
        if(!head) return head;
        ListNode* cur=head;
        int count=1;
        while(cur&&cur->next){
            cur=cur->next;
            count++;
        }
        k=k%count;
        cur->next=head;
        for(int i=0;i<count-k;i++){
            cur=cur->next;
        }
        head=cur->next;
        cur->next=nullptr;
        return head;
    }
};