Wiggle Sort - keepshuatishuati

Wiggle Sort

 1 public class Solution {
 2     public void wiggleSort(int[] nums) {
 3         if (nums == null || nums.length < 2) {
 4             return;
 5         }
 6         
 7         for (int i = 1; i < nums.length; i++) {
 8             int a = nums[i-1];
 9             if ((i % 2 == 1) == (a > nums[i])) {
10                 nums[i - 1] = nums[i];
11                 nums[i] = a;
12             }
13         }
14         
15     }
16 }

O (n) solution.

posted on 2016-07-07 13:01 keepshuatishuati 阅读(143) 评论(0) 编辑收藏举报