Leetcode 189 Rotate Array

pessis1

于 2017-06-06 10:42:25 发布

阅读量122

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.csdn.net/pessis1/article/details/72875638

Leetcode 专栏收录该内容

167 篇文章

订阅专栏

本文介绍了一种使用反转方法实现数组元素右移k步的原地旋转算法，并提供了详细的步骤及Java代码实现。

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

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.

[show hint]

Related problem: Reverse Words in a String II

用reverse的方法原地rotate

1 2 3 4 5 6 7

7 6 5 4 3 2 1

5 6 7 1 2 3 4

brilliant！！~~

public class Solution {
    public void rotate(int[] nums, int k) {
        reverse(nums, 0, nums.length - 1);
        reverse(nums, 0 ,k -1);
        reverse(nums, k , nums.length - 1);
    }
    
    
    
    private void reverse(int[] nums, int m, int n){
        while(m < n){
            int tmp = nums[m];
            nums[m] = nums[n];
            nums[n] = tmp;
            m++;
            n--;
        }
    }
}