189. Rotate Array

题目：https://leetcode.com/problems/rotate-array/

代码：

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