题目链接
java
class Solution {
public void reverse(int[] nums, int i, int j) {
while (i < j && i >= 0 && j < nums.length) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
i++;
j--;
}
}
public void rotate(int[] nums, int k) {
k = k % nums.length;
reverse(nums, 0, nums.length - 1);
reverse(nums, 0, k - 1);
reverse(nums, k, nums.length - 1);
}
}
小结:做过这道题,知道思路就可以秒。