280. Wiggle Sort

Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3]…

Example:

Input: nums = [3,5,2,1,6,4]
Output: One possible answer is [3,5,1,6,2,4]

方法1: sort

思路：

排序之后，从第二个数开始两两交换。

Complexity

Time complexity: O(nlogn)
Space complexity: O(1)

易错点

1. boundary

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

方法2: two pointers

思路：

审题真的很重要。wiggle的方向是确定的，利用奇偶性来判断当前数字是否在正确的位置即可。

Complexity

Time complexity: O(n)
Space complexity: O(1)

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