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

思路：

其实就是先把链表的首尾链接在一起转化成一个循环链表；

计算出链表的长度len

然后再从头到尾找倒数第k%len个结点  也就是从head起第len-k%len个元素；

/**
 * 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==nullptr||head->next==nullptr)
            return head;
        ListNode *cur=head;
        int len=1;
        while(cur->next)
        {
            cur=cur->next;
            len++;
        }
        cur->next=head;
        ListNode *node=head;
        for(int i=1;i<len-k%len;i++)//倒数第k个 也就是  正着数 第len-k%len；
            node=node->next;
        ListNode *res=node->next;
        //=nullptr;
        node->next=nullptr;
        
        return res;
            
    }
};