leetcode WiggleSortII
z
 2019-04-09 10:36:27   
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.Arrays;

public class WiggleSortII {
  /**
   * Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....
   *
   * Example 1:
   *
   * Input: nums = [1, 5, 1, 1, 6, 4]
   * Output: One possible answer is [1, 4, 1, 5, 1, 6].
   * Example 2:
   *
   * Input: nums = [1, 3, 2, 2, 3, 1]
   * Output: 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 void wiggleSort(int[] nums) {
    Arrays.sort(nums);
    int start = 0;
    int n = nums.length;
    int end = nums.length;

    for (int i=1; i<n; i+=2){

    }
  }
}