Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.
Example 1:
Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps to the right: [5,6,7,1,2,3,4]
Example 2:
Input: nums = [-1,-100,3,99], k = 2 Output: [3,99,-1,-100] Explanation: rotate 1 steps to the right: [99,-1,-100,3] rotate 2 steps to the right: [3,99,-1,-100]
Constraints:
1 <= nums.length <= 105-231 <= nums[i] <= 231 - 10 <= k <= 105
Follow up:
O(1) extra space?class Solution {
public:
void rotate(vector<int>& nums, int k) {
vector <int> v;
k %= nums.size();
for (int i=nums.size()-k; i<nums.size();i++)
v.push_back(nums[i]);
for (int i=nums.size()-1; i>k-1;i--)
nums[i] = nums[i-k];
for (int i=0; i<k;i++)
nums[i] = v[i];
}
};class Solution {
public void rotate(int[] nums, int k) {
int n = nums.length;
k %= n;
int[] temp = new int[k];
for (int i = 0; i < k; i++)
temp[i] = nums[n + i - k];
for (int i = n - 1; i >= k; i--)
nums[i] = nums[i - k];
for (int i = 0; i < k; i++)
nums[i] = temp[i];
}
}class Solution {
public void rotate(int[] nums, int k) {
int n = nums.length;
k %= n;
reverse(nums, 0, n-1);
reverse(nums, 0, k-1);
reverse(nums, k, n-1);
}
private void reverse(int[] nums, int lt, int rt){
while(lt<rt){
int temp = nums[lt];
nums[lt] = nums[rt];
nums[rt] = temp;
lt++;
rt--;
}
}
}class Solution {
public void rotate(int[] nums, int k) {
int n = nums.length;
k %= n;
reverse(nums, 0, n-1);
reverse(nums, 0, k-1);
reverse(nums, k, n-1);
}
private void reverse(int[] nums, int lt, int rt){
while(lt<rt){
int temp = nums[lt];
nums[lt] = nums[rt];
nums[rt] = temp;
lt++;
rt--;
}
}
}