leetcode (java) 189. Rotate Array

最新推荐文章于 2024-08-15 05:02:54 发布

绿风天空

最新推荐文章于 2024-08-15 05:02:54 发布

阅读量304

点赞数

分类专栏： leetcode(java) 文章标签： leetcode 算法 java

本文链接：https://blog.csdn.net/jmqxnxg/article/details/128658770

版权

leetcode(java) 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Q: Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.

A: I can use three methods to solve this problems.

a) Reverse the array three times.

For array [1,2,3,4,5] k = 2

firstly, I reverse the whole array and get arrary[5,4,3,2,1]

secondly, I reverse the fisrt k numbers and get arrary [4,5,3,2,1]

thirdly, I reverse the remaining numbers and get array [4,5,1,2,3].

Now , the array is the answer

class Solution {
    public void rotate(int[] nums, int k) {
        k = k % nums.length;
        reverse(nums, 0, nums.length);
        reverse(nums, 0, k);
        reverse(nums, k, nums.length);
    }

    public static void reverse(int[] nums, int start, int end){
        int t;
        for(int i=start; i<nums.length && end-1-(i-start) < nums.length && i<start + (end-start)/2;i++){
            t = nums[i];
            nums[i] = nums[end-1-(i-start)];
            nums[end-1-(i-start)] = t;
        }
    }
}

b) New another array and copy numbers from the original array

c) bubble swap numbers from back to front k times

every loop will move the last number to the first

it is similar to the bubble sorting algorithm