Leetcode 280. Wiggle Sort (Medium) (cpp)

最新推荐文章于 2020-11-12 10:03:09 发布

Niko_Ke

最新推荐文章于 2020-11-12 10:03:09 发布

阅读量335

点赞数

分类专栏： Leetcode C++ C++ Leetcode Array Leetcode Sort Leetcode Locked 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52821092

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

Leetcode 280. Wiggle Sort (Medium) (cpp)

Tag: Array, Sort

Difficulty: Medium

这是一道locked题目，给评论个“赞”呗？

/*

280. Wiggle Sort (Medium)

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

For example, given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4].

*/
class Solution {
public:
    void wiggleSort(vector<int>& nums) {
        for (int i = 1; i < nums.size(); i++) {
            if ((i % 2 == 1 && nums[i] < nums[i - 1]) || (i % 2 == 0 && nums[i] > nums[i - 1])) {
                swap(nums[i], nums[i - 1]);
            }
        }
    }
};
class Solution {
public:
    void wiggleSort(vector<int>& nums) {
        if (nums.empty()) {
            return;
        }
        sort(nums.begin(), nums.end());
        swap(nums.back(), nums[nums.size() / 2]);
        if (nums.size() % 2) {
            wiggleSort(nums, 0, nums.size() - 2);
        } else {
            wiggleSort(nums, 0, nums.size() - 1);
        }
    }
private:
    void wiggleSort(vector<int>& nums, int l, int r) {
        if (l < r - 1) {
            int _size = r - l + 1, i = l + _size / 4, mid = l + _size / 2, j = l + 3 * _size / 4;
            reverse(nums.begin() + i, nums.begin() + mid);
            reverse(nums.begin() + mid, nums.begin() + j);
            reverse(nums.begin() + i, nums.begin() + j);
            wiggleSort(nums, l, l + 2 * (i - l) - 1);
            wiggleSort(nums, l + 2 * (i - l), r);
        }
    }
};