leetcode——189——Rotate Array

最新推荐文章于 2025-09-13 14:08:34 发布

原创最新推荐文章于 2025-09-13 14:08:34 发布 · 262 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法题

leetcode 专栏收录该内容

277 篇文章

订阅专栏

本文提供了一种使用C++编程语言解决旋转数组问题的方法，具体包括通过三次反转操作来实现数组的右移操作。文章详细介绍了算法的实现过程，并通过示例代码加以说明。

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.

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

};