leetcode Rotate Array题解

题目描述：

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

Example 1:

Input: [1,2,3,4,5,6,7] and k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]

Example 2:

Input: [-1,-100,3,99] and k = 2
Output: [3,99,-1,-100]
Explanation: 
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]

中文理解：将数组向右旋转，将旋转后的结果放在原来的数组里面。

解题思路：使用辅助数据，numsCopy[(i+k)%nums.length]=nums[i]，再将结果从numsCopy放回nums中。

代码（java）：

class Solution {
    public void rotate(int[] nums, int k) {
        int []numsCopy=new int[nums.length];
        for(int i=0;i<nums.length;i++){
            numsCopy[(i+k)%nums.length]=nums[i];
        }
        for(int i=0;i<nums.length;i++){
            nums[i]=numsCopy[i];
        }
    }
}