Eric 的小站

1
输入：head = [1,2,3,4,5], k = 2
2
输出：[4,5,1,2,3]

1
输入：head = [0,1,2], k = 4
2
输出：[2,0,1]

1
/**
2
 * Definition for singly-linked list.
3
 * struct ListNode {
4
 *     int val;
5
 *     ListNode *next;
6
 *     ListNode() : val(0), next(nullptr) {}
7
 *     ListNode(int x) : val(x), next(nullptr) {}
8
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
9
 * };
10
 */
11
class Solution {
12
public:
13
    ListNode* rotateRight(ListNode* head, int k) {
14
        if (head == nullptr) return head;
15
        ListNode * result = new ListNode();
16
        ListNode * p = head, *q = result;
17
        vector<ListNode*> vtr;
18
        while(p){
19
            vtr.push_back(p);
20
            p = p->next;
21
        }
22

23
        for(int i=vtr.size()-k%vtr.size();i<vtr.size();i++){
24
            q -> next = vtr[i];
25
            q = q->next;
26
        }
27
        vtr[vtr.size()-k%vtr.size()-1]->next = nullptr;
28
        q->next = vtr[0];
29
        return result->next;
30
    }
31
};