【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

给一个链表，和一个从链表右端开始数的位置，将该位置以后的链表移到开头，与链表剩余的部分连接。

/**
 * 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) {
        ListNode* tail=head;
        
        if(head==NULL) return head;
        
        int n = 1;
        while(tail->next!=NULL){//先计算链表长度
            tail = tail->next;
            n++;
        }
        k %= n;//k对链表长度n取余
        if(k==0) return head;
        int index = n-k+1;
        ListNode *pre=NULL,*curr=head;
        for(int i=1;i<index;i++){
            pre = curr;
            curr = curr->next;
        }
        tail->next = head;
        pre->next = NULL;
        head = curr;
        
        return head;
    }
};

还是挺简单的。