方法一:使用双端队列
class Solution {
public void rotate(int[] nums, int k) {
Deque<Integer> queue = new LinkedList<>();
for(int num : nums){
queue.addLast(num);
}
while(k>0){
int num = queue.removeLast();
queue.addFirst(num);
k--;
}
int index = 0;
while(!queue.isEmpty()){
nums[index++] = queue.removeFirst();
}
}
}