LeetCode 280. 摆动排序

示例:
输入: nums = [3,5,2,1,6,4]
输出: 一个可能的解答是 [3,5,1,6,2,4]

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