324. swing sequencing II

Original link ：324. Swing sort II

 

solution:
        

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