leetcode 280: Wiggle Sort

Wiggle Sort

Total Accepted: 1291  Total Submissions: 3008  Difficulty: Medium

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

For example, given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4].

[思路]

greedy即可. 

转自：点击打开链接

[CODE]

[java]  view plain  copy

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