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].
题意:将数组内元素向右移动k步
解决思路:当前位置+k除以数组长度的余数为新的位置
代码:
public class Solution {
public void rotate(int[] nums, int k) {
int[] result = new int[nums.length];
for(int i = 0;i < nums.length;&