324. Wiggle Sort II | LeetCode

Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....

Example:
(1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is [1, 4, 1, 5, 1, 6]. 
(2) Given nums = [1, 3, 2, 2, 3, 1], one possible answer is [2, 3, 1, 3, 1, 2].

Note:
You may assume all input has valid answer.

Follow Up:
Can you do it in O(n) time and/or in-place with O(1) extra space?

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

思路：上来看到这道题觉得挺简单的可能和Wiggle Sort 1 差不多，排个序换换位置就行了。后来发现 4，5，5，6这种序列没有办法直接解决。所以我参考了discuss的思路，写得很清楚。。https://leetcode.com/discuss/76965/3-lines-python-with-explanation-proof

下图一目了然，

Small half:  M . S . S . S      Small half:  M . S . S . S .
Large half:  . L . L . M .      Large half:  . L . L . L . M
--------------------------      --------------------------
Together:    M L S L S M S      Together:    M L S L S L S M

简单来说，先用找到中间的值。 然后再按照上图的方法插空即可。这里我用了一个STL 的 nth_element用来找中间值，其实这个就是STL的quickselect，这里当练个手。然后插空的过程中，我发现有很多tricky的办法，比如3-way－parition之类的。但是我实在懒得想了，直接用排序做的（其实早知道会用排序，上面找中间值也不用quick select的，直接sort取中间就好）。

代码如下：

class Solution {
    static bool cmp(int a,int b) {return a>b;};
public:
    void wiggleSort(vector<int>& nums) {
        auto it =  nums.begin()+(nums.size()-1)/2;
        nth_element(nums.begin(), it, nums.end());
        sort(nums.begin(),it+1,cmp);
        sort(it+1,nums.end(),cmp);
        vector<int> result;
        int left = 0, right = (nums.size()-1)/2+1;
        for (int i = 0; i < nums.size(); i++) {
            if (i%2 == 0) result.push_back(nums[left++]);
            if (i%2 == 1) result.push_back(nums[right++]);
        }
        nums = result;
        return;
    }
};