LeetCode Q280: 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].

Solution:

	class Solution {
	public:
	void wiggleSort(vector<int>& nums) {
	int n = nums.size();
	for (int i = 1; i < n; i++){
	if(i%2==1 && nums[i]<nums[i-1])
	swap(nums[i], nums[i-1]);
	if(i%2==0 && nums[i]>nums[i-1])
	swap(nums[i], nums[i-1]);
	}
	}
	};

view raw Q280.cpp hosted with ❤ by GitHub