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]
.
public class Solution {
public void wiggleSort(int[] nums) {
Arrays.sort(nums);
if (nums.length < 3) {
return;
}
for (int i = 1; i < nums.length - 1; i = i + 2) {
int temp = nums[i];
nums[i] = nums[i + 1];
nums[i + 1] = temp;
}
}
}
或者从前到后,如果当前是奇数位,那么他应该比之前的数小,违反规则的话就交换他跟他之前的数;如果是偶数位,他应该比之前的数大,违反规则就交换他跟他之前的数。代码如下:
public class Solution {
public void wiggleSort(int[] nums) {
for(int i=0;i<nums.length;i++)
if(i%2==1){
if(nums[i-1]>nums[i]) swap(nums, i);
}else if(i!=0 && nums[i-1]<nums[i]) swap(nums, i);
}
public void swap(int[] nums, int i){
int tmp=nums[i];
nums[i]=nums[i-1];
nums[i-1]=tmp;
}
}
逻辑再进行简化就是下面的代码:
public void wiggleSort(int[] nums) {
for (int i=1; i<nums.length; i++) {
int a = nums[i-1];
if ((i%2 == 1) == (a > nums[i])) {
nums[i-1] = nums[i];
nums[i] = a;
}
}
}