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.
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
More solutions are shown in https://leetcode.com/discuss/27387/summary-of-c-solutions
My Solution:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Solution { | |
public: | |
void rotate(vector<int>& nums, int k) { | |
k=k%nums.size(); | |
reverse(nums.begin(), nums.end()); | |
reverse(nums.begin(), nums.begin()+k); | |
reverse(nums.begin()+k, nums.end()); | |
} | |
}; |
No comments:
Post a Comment