0324 solved.

liuyubobobo · liuyubobobo · commit 05f82d793bdf · 2022-06-27T11:20:04.000-07:00
diff --git a/0001-0500/0324-Wiggle-Sort-II/cpp-0324/CMakeLists.txt b/0001-0500/0324-Wiggle-Sort-II/cpp-0324/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_0324)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_0324 main.cpp)
diff --git a/0001-0500/0324-Wiggle-Sort-II/cpp-0324/main.cpp b/0001-0500/0324-Wiggle-Sort-II/cpp-0324/main.cpp
@@ -0,0 +1,71 @@
+/// Source : https://leetcode.com/problems/wiggle-sort-ii/
+/// Author : liuyubobobo
+/// Time   : 2022-06-27
+
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <cassert>
+
+using namespace std;
+
+
+/// Ad-Hoc
+/// Time Complexity: O(nlogn)
+/// Space Complexity: O(n)
+class Solution {
+public:
+    void wiggleSort(vector<int>& nums) {
+
+        int n = nums.size();
+
+        sort(nums.begin(), nums.end());
+
+        vector<int> res(n);
+        int index = 0;
+        for(int i = 0; i < n; i += 2) res[i] = nums[index ++];
+        for(int i = 1; i < n; i += 2) res[i] = nums[index ++];
+
+        if(ok(n, res)){
+            nums = res;
+            return;
+        }
+
+        assert(n % 2 == 0);
+
+        index = 0;
+        for(int i = 1; i < n; i += 2) res[i] = nums[index ++];
+        for(int i = 0; i < n; i += 2) res[i] = nums[index ++];
+        reverse(res.begin(), res.end());
+        assert(ok(n, res));
+        nums = res;
+    }
+
+private:
+    bool ok(int n, const vector<int>& a){
+
+        for(int i = 1; i + 1 < n; i ++){
+            if(i % 2 == 1){
+                if(!(a[i - 1] < a[i] && a[i] > a[i + 1])) return false;
+            }
+            else{
+                if(!(a[i - 1] > a[i] && a[i] < a[i + 1])) return false;
+            }
+        }
+        return true;
+    }
+};
+
+
+void print_vec(const vector<int>& v){
+    for(int e: v) cout << e << ' '; cout << '\n';
+}
+
+int main() {
+
+    vector<int> nums1 = {4, 5, 5, 6};
+    Solution().wiggleSort(nums1);
+    print_vec(nums1);
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -359,7 +359,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | 321 | [Create Maximum Number](https://leetcode.com/problems/create-maximum-number/) | [无] | [C++](0001-0500/0321-Create-Maximum-Number/cpp-0321/) | | |
 | 322 | [Coin Change](https://leetcode.com/problems/coin-change/description/) | [solution](https://leetcode.com/problems/coin-change/solution/) | [C++](0001-0500/0322-Coin-Change/cpp-0322/) | | |
 | 323 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | [solution](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/solution/) |  [C++](0001-0500/0323-Number-of-Connected-Components-in-an-Undirected-Graph/cpp-0323/) | | |
-| | | | | | |
+| 324 | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/) | [无] | [C++](0001-0500/0324-Wiggle-Sort-II/cpp-0324/) | | |
 | 325 | [Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/) | [solution](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/solution/) | [C++](0001-0500/0325-Maximum-Size-Subarray-Sum-Equals-k/cpp-0325/) | | |
 | 326 | [Power of Three](https://leetcode.com/problems/power-of-three/) | [solution](https://leetcode.com/problems/power-of-three/solution/) | [C++](0001-0500/0326-Power-of-Three/cpp-0326/) | | |
 | | | | | | |
