java:
class Solution {
public void rotate(int[] nums, int k) {
k = k % nums.length;//注!!移动k个位置当k超过数组长度时候,需要取余
swapNums(nums, 0, nums.length - 1);
swapNums(nums, 0, k - 1);
swapNums(nums, k, nums.length - 1);
}
public void swapNums(int[] nums, int left, int right) {
while (left < right) {
int tem = nums[left];
nums[left] = nums[right];
nums[right] = tem;
left++;
right--;
}
}
}