lurenaa的博客

  

1
2
3
4
5
6
7
8
9
10
11
class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int last_one;
        while(--k >= 0) {
            last_one = nums.back();
            nums.pop_back();
            nums.insert(nums.begin(), last_one);
        }
    }
};

Accepted

34/34 cases passed (336 ms)

Your runtime beats 6.57 % of cpp submissions

Your memory usage beats 5.01 % of cpp submissions (10.1 MB)


 上一页

LeetCode