-
Notifications
You must be signed in to change notification settings - Fork 0
/
leetcode_189.cpp
44 lines (41 loc) · 1.09 KB
/
leetcode_189.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
class Solution {
public:
void rotate(vector<int>& nums, int k) {
int length = nums.size();
k = k % length;
if (k == 0) return;
vector<int> first(nums.begin(), nums.begin() + length - k);
vector<int> second(nums.begin() + length - k, nums.end());
for (int i = 0; i < k; i++){
nums[i] = second[i];
}
for (int i = k; i < length; i++){
nums[i] = first[i - k];
}
return;
}
};
class Solution {
public:
void rotate(vector<int>& nums, int k) {
int length = nums.size();
k = k % length;
reverse(nums.begin(), nums.end());
reverse(nums.begin(), nums.begin() + k);
reverse(nums.begin() + k, nums.end());
return;
}
};
class Solution {
public:
void rotate(vector<int>& nums, int k) {
int length = nums.size();
k = k % length;
vector<int> array(length);
for (int i = 0; i < length; i++){
array[(i + k) % length] = nums[i];
}
nums.assign(array.begin(), array.end());
return;
}
};