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.
編程珠璣里面也有類似這種思路的例子
class Solution {public: void rotate(vector<int>& nums, int k) { int n = nums.size(); reverse(nums.begin(), nums.begin() + n - k % n); reverse(nums.begin() + n - k % n, nums.begin() + n); reverse(nums.begin(), nums.end()); }};新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
