-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path0280_WiggleSort.cpp
More file actions
45 lines (42 loc) · 1.05 KB
/
Copy path0280_WiggleSort.cpp
File metadata and controls
45 lines (42 loc) · 1.05 KB
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
45
#include <vector>
using namespace std;
class Solution
{
public:
// nums[0] <= nums[1] >= nums[2] <= nums[3] ...
void wiggleSort(vector<int> &nums)
{
// size = 0
if (nums.size() == 1)
return;
// size = 1
if (nums[0] > nums[1]) {
std::swap(nums[0], nums[1]);
}
// rest
for (int i = 1; i < nums.size() - 1; ++i) {
if (i % 2) {
// odd case
if (nums[i] < nums[i - 1]) {
swap(nums[i], nums[i - 1]);
}
if (nums[i] < nums[i + 1]) {
swap(nums[i], nums[i + 1]);
}
} else {
// even case
if (nums[i] > nums[i - 1]) {
swap(nums[i], nums[i - 1]);
}
if (nums[i] > nums[i + 1]) {
swap(nums[i], nums[i + 1]);
}
}
}
}
};
int main()
{
vector nums1{3, 5, 2, 1, 6, 4};
vector nums2{6, 6, 5, 6, 3, 8};
}