Package g0301_0400.s0324_wiggle_sort_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    324 - Wiggle Sort II\.

    Medium

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

    You may assume the input array always has a valid answer.

    Example 1:

    Input: nums = 1,5,1,1,6,4

    Output: 1,6,1,5,1,4

    Explanation: 1,4,1,5,1,6 is also accepted.

    Example 2:

    Input: nums = 1,3,2,2,3,1

    Output: 2,3,1,3,1,2

    Constraints:

    • <code>1 <= nums.length <= 5 * 10<sup>4</sup></code>

    • 0 &lt;= nums[i] &lt;= 5000

    • It is guaranteed that there will be an answer for the given input nums.

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

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Unit wiggleSort(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait