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

Solution：

class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(head == nullptr || k == 0)
            return head;
        
        int len = 1;
        ListNode* p = head;
        while(p->next)
        {
            len++;
            p = p->next;
        }
        
        k = len - k % len;
        p->next = head; // 首尾相连，形成一个环
        
        for(auto i=0; i<k; ++i)
        {
            p = p->next; // 接着往后跑
        }
        
        head = p->next;
        p->next = nullptr; // 断开环
        return head;
    }
};