122人阅读 评论(0)

# 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++)
list.add(nums[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));

}
}


0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：24358次
• 积分：672
• 等级：
• 排名：千里之外
• 原创：108篇
• 转载：5篇
• 译文：0篇
• 评论：0条
文章分类
评论排行