# 1 题目描述

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.

# 3 源代码

package com.larry.easy;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class RotateArray {
public void rotate(int[] nums, int k) {
int len = nums.length;
if(k >= len) k %= len;

List<Integer> list = new ArrayList<Integer>();
for(int i = len-k; i < len; i++)
for(int i = 0; i < len-k; i++)
nums[len-1-i] = nums[len-k-i-1];
for(int i = 0; i < k; i++)
nums[i] = list.get(i);
}

public static void main(String[] args) {
/*int[] nums = {1,2,3,4,5,6,7};
int k = 3;*/
/*int[] nums = {1,2};
int k = 3;*/
int[] nums = {1,2,3};
int k = 1;
RotateArray ra = new RotateArray();
ra.rotate(nums, k);
System.out.println(Arrays.toString(nums));

}
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：Rotate Array 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)