leetcode 280

Leetcode 280. Wiggle Sort

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

Example:
Input: nums = [3,5,2,1,6,4]
Output: One possible answer is [3,5,1,6,2,4]

Solution:

class Solution {
    public void wiggleSort(int[] nums) {
		Arrays.sort(nums);
		for(int i=1; i<nums.length-1; i+=2) {
			swap(nums,i,i+1);
		}
	}
	public void swap(int[] nums, int a, int b) {
		int temp=nums[a];
		nums[a]=nums[b];
		nums[b]=temp;
	}
}