lintcode 508.Wiggle Sort

题目：

LintCode 508. 摆动排序

给你一个没有排序的数组，请将原数组就地重新排列满足如下性质

nums[0] <= nums[1] >= nums[2] <= nums[3]....

方案：

class Solution {
public:
    /*
    * @param nums: A list of integers
    * @return: nothing
    */
    void wiggleSort(vector<int> &nums) const {
        const int len = nums.size();

        if (len < 2)
        {
            return;
        }

        bool flag_query_min = true;
        for (int i = 0; i < len; ++i)
        {
            int curr_idx = i;
            for (int j = i+1; j < i + 3 && j < len; ++j)
            {
                if (flag_query_min)
                {
                    if (nums[j] < nums[curr_idx])
                    {
                        curr_idx = j;
                    }
                }
                else
                {
                    if (nums[j] > nums[curr_idx])
                    {
                        curr_idx = j;
                    }
                }
            }

            if (curr_idx != i)
            {
                std::swap(nums[i], nums[curr_idx]);
            }

            flag_query_min = !flag_query_min;
        }
    }
};

//z 2018-01-16 23:59:30 L.349'30    T2283528791.K.F2338414085[T1,L15,R1,V2]