class Solution {
public:
void rotate(vector<int>& nums, int k) {
if(nums.size() < k)
k = k % nums.size();
vector<int> content(k, 0);
copy(nums.end() - k, nums.end(), content.begin());
for(int i = nums.size() - k - 1; i >= 0; --i){
nums[i + k] = nums[i];
}
copy(content.begin(), content.end(), nums.begin());
}
};
189. Rotate Array
最新推荐文章于 2019-06-17 17:39:11 发布