LeetCode 189.轮转数组
给定一个整数数组
nums
,将数组中的元素向右轮转k
个位置,其中k
是非负数。输入: nums = [1,2,3,4,5,6,7], k = 3
输出: [5,6,7,1,2,3,4]
解释:
向右轮转 1 步: [7,1,2,3,4,5,6]
向右轮转 2 步: [6,7,1,2,3,4,5]
向右轮转 3 步: [5,6,7,1,2,3,4]
my_code:
class Solution {
public:
void rotate(vector<int>& nums, int k) {
int len = nums.size();
vector<int> ans(len,0);
int s = k % len;
for(int i=0;i<len-s;i++){
ans[s+i]=nums[i];
}
for(int i=0;i<s;i++){
ans[i] = nums[len-s+i];
}
for(int i =0;i<len;i++){
nums[i]=ans[i];
}
}
};
利用额外的空间来存储旋转后的数组。时间复杂O(n),空间复杂度也是O(n)
题解:
-
环状替代
class Solution { public: void rotate(vector<int>& nums, int k) { int n = nums.size(); k = k % n; int count = gcd(k, n); for (int start = 0; start < count; ++start) { int current = start; int prev = nums[start]; do { int next = (current + k) % n; swap(nums[next], prev); current = next; } while (start != current); } } };
-
操作 结果 原始数组 [1,2,3,4,5,6,7] 全部翻转 [7,6,5,4,3,2,1] 0~k mod len-1翻转 [5,6,7,4,3,2,1] k mod len -1 ~ len-1翻转 [5,6,7,1,2,3,4]
,7,4,3,2,1] |
| k mod len -1 ~ len-1翻转 | [5,6,7,1,2,3,4] |
时间复杂度为O(1)