leetcode 189. Rotate Array_leetcode alfheim

leetcode 189. Rotate Array

调库：

class Solution 
{
public:
    void rotate(vector<int>& nums, int k) 
    {
        int len=nums.size();
        k=k%len;
        vector<int> vec_a(nums.end()-k,nums.end());
        vector<int> vec_b(nums.begin(),nums.end()-k);
        vector<int> vec_merge;
        vec_merge.insert(vec_merge.end(),vec_a.begin(),vec_a.end());
        vec_merge.insert(vec_merge.end(),vec_b.begin(),vec_b.end());
        nums=vec_merge;
        return;
    }
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16