324. Wiggle Sort II

最新推荐文章于 2021-12-06 20:38:16 发布

zhouyanz

最新推荐文章于 2021-12-06 20:38:16 发布

阅读量290

点赞数

分类专栏： Leetcode 文章标签： Java LeetCode

本文链接：https://blog.csdn.net/zhouyanz/article/details/50953031

版权

Leetcode 专栏收录该内容

196 篇文章 0 订阅

订阅专栏

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

Example:
(1) Given nums = [1, 5, 1, 1, 6, 4], one possible answer is [1, 4, 1, 5, 1, 6].
(2) Given nums = [1, 3, 2, 2, 3, 1], one possible answer is [2, 3, 1, 3, 1, 2].

Note:
You may assume all input has valid answer.

Follow Up:
Can you do it in O(n) time and/or in-place with O(1) extra space?

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

题目要求o(n) o(1) 结果发现Arraysort也能过……回头再看

public class Solution {
    public void wiggleSort(int[] nums) {  
        Arrays.sort(nums);  //这是个复杂度nlogn的。。
        int[] temp = new int[nums.length];  
        int s = (nums.length + 1) >> 1, t = nums.length;  
        for (int i = 0; i < nums.length; i++) {  
            temp[i] = (i & 1) == 0 ?  nums[--s] : nums[--t] ;  
        }  
  
        for (int i = 0; i < nums.length; i++)  
            nums[i] = temp[i];  
    }  
}