原题网址:https://leetcode.com/problems/wiggle-sort/
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) {
for(int i=0; i<nums.length-1; i++) {
if ((i&1)==0) {
if (nums[i]>nums[i+1]) {
int t = nums[i];
nums[i] = nums[i+1];
nums[i+1] = t;
}
} else {
if (nums[i]<nums[i+1]) {
int t = nums[i];
nums[i] = nums[i+1];
nums[i+1] = t;
}
}
}
}
}