[leetcode 324] 摆动排序 II 思维+排序

class Solution {
public:
    void wiggleSort(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        int n = nums.size();
        vector<int> v(n);
        int r = n - 1,l = 1;
        for(;l < n;l += 2) {
            v[l] = nums[r];
            r --;
        }
        for(l = 0;l < n;l += 2) {
            v[l] = nums[r];
            r --;
        }
        nums = v;
    }
};