【LeetCode】189 Rotate Array

于 2015-12-02 13:21:14 发布

阅读量262

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/yuanzexi/article/details/50146951

LeetCode 专栏收录该内容

29 篇文章

订阅专栏

本文介绍了一种方法，用于将数组元素向右移动指定步数，并提供了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].

Congratulation! My runtime beats 98.27% of java submissions! It is the best one for me by now.

public class Solution {
    public void rotate(int[] nums, int k) {
        int t = k / nums.length +3;
        int[] result = new int[nums.length*t];
        for(int i = 0; i < t ;i++){
            System.arraycopy(nums,0,result,i*nums.length,nums.length);
        }
        System.arraycopy(result,2*nums.length-k,nums,0,nums.length);
    }
}