Total Accepted: 51189
Total Submissions: 264292
Difficulty: Easy
Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7]
is rotated to [5,6,7,1,2,3,4]
.
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
code:
class Solution {
public:
void rotate(vector<int>& nums, int k) {
int numsSize=nums.size();
reverse(nums, 0, numsSize - 1);
reverse(nums, 0, k % numsSize - 1);
reverse(nums, k % numsSize, numsSize - 1);
}
void reverse(vector<int>& nums,int i, int j) {
while(i < j) {
nums[i] =nums[i] ^ nums[j];
nums[j] =nums[i] ^ nums[j];
nums[i] =nums[i] ^ nums[j];
i++;j--;
}
}
};