LeetCode 324. Wiggle Sort II（摇摆排序）

来源：互联网发布：阿里云未备案可以cdn 编辑：程序博客网时间：2024/04/27 15:35

原题网址：https://leetcode.com/problems/wiggle-sort-ii/

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?

方法：先排序，然后分成两半进行交替插入。

public class Solution {    public void wiggleSort(int[] nums) {        int[] sort = nums.clone();        Arrays.sort(sort);        for(int i=(sort.length-1)/2, j=0; i>=0; i--, j+=2) nums[j]=sort[i];        for(int i=sort.length-1, j=1; i>(sort.length-1)/2; i--, j+=2) nums[j]=sort[i];    }}

时间复杂度是O(nlogn)，空间复杂度O(n)，暂时还做不到时间复杂度O(n)和空间复杂度O(1)

0 0