LeetCode:Rotate Array

最新推荐文章于 2018-09-30 10:01:59 发布

原创最新推荐文章于 2018-09-30 10:01:59 发布 · 544 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Rotate Array

LeetCode OJ 同时被 2 个专栏收录

216 篇文章

订阅专栏

LeetCode解题记录

216 篇文章

订阅专栏

本文详细介绍了如何使用C++实现旋转数组的功能，包括代码实现、核心思想和三种不同的解决方案。通过实例分析，帮助读者深入理解旋转数组的概念及其在编程中的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Rotate Array

Total Accepted: 51189 Total Submissions: 264292 Difficulty: Easy

Rotate an array of n elements to the right by k steps.

For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].

Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

code:

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int numsSize=nums.size();
        reverse(nums, 0, numsSize - 1);
        reverse(nums, 0, k % numsSize - 1);
        reverse(nums, k % numsSize, numsSize - 1);
    }
    void reverse(vector<int>& nums,int i, int j) {
        while(i < j) {
            nums[i] =nums[i] ^ nums[j];
            nums[j] =nums[i] ^ nums[j];
            nums[i] =nums[i] ^ nums[j];
            i++;j--;
        }
    }
};