Leetcode 189. Rotate Array

最新推荐文章于 2022-07-20 17:01:48 发布

SnailTyan

最新推荐文章于 2022-07-20 17:01:48 发布

阅读量237

点赞数

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.csdn.net/Quincuntial/article/details/83043365

版权

Leetcode 同时被 2 个专栏收录

409 篇文章 18 订阅

订阅专栏

Algorithm

260 篇文章 2 订阅

订阅专栏

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

Rotate Array

2. Solution

Version 1

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        int start = n - k % n;
        int remainder = k % n;
        vector<int> v(n);
        for(int i = 0; i < remainder; i++) {
            v[i] = nums[i + start];
        }
        for(int i = 0; i < start; i++) {
            v[i + remainder] = nums[i];
        }
        for(int i = 0; i < n; i++) {
            nums[i] = v[i];
        }
    }
};

Version 2

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        int start = n - k % n;
        int remainder = k % n;
        vector<int> v(remainder);
        for(int i = 0; i < remainder; i++) {
            v[i] = nums[i + start];
        }
        for(int i = n - 1; i >= remainder; i--) {
            nums[i] = nums[i - remainder];
        }
        for(int i = 0; i < remainder; i++) {
            nums[i] = v[i];
        }
    }
};

Version 3

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        reverse(nums.begin(), nums.end());
        reverse(nums.begin(), nums.begin() + k % n);
        reverse(nums.begin() + k % n, nums.end());
    }
};