Leetcode 280: 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; i++)
        {
            if (i % 2 == 1)
            {
                if (nums[i - 1] > nums[i])
                {
                    Swap(nums, i - 1, i);
                }
            }
            else if (i != 0)
            {
                if (nums[i] > nums[i - 1])
                {
                    Swap(nums, i - 1, i);
                }
            }
        }
    }
    
    private void Swap(int[] nums, int i, int j) 
    {
          int tmp = nums[i];
          nums[i] = nums[j];
          nums[j] = tmp;
    }
}