Wiggle Sort

LeetCode Link

Problem Description

Visit LeetCode for the full problem description.

---

Solutions

Solution 1: C# (Best: 154 ms)

Metric	Value
Runtime	154 ms
Memory	43.7 MB
Date	2022-01-25

Solution

public class Solution {
    public void WiggleSort(int[] nums) {
        for(int i=1;i<nums.Length;i++)
        {            
            if(i%2 == 1 && nums[i-1]>nums[i])
            {
                int temp = nums[i-1];
                nums[i-1] = nums[i];
                nums[i] = temp;
            }
            else if(i%2 == 0 && nums[i-1]<nums[i])
            {
                int temp = nums[i-1];
                nums[i-1] = nums[i];
                nums[i] = temp;
            }
        }
    }
}

---

Complexity Analysis

Approach	Time	Space
Solution	To be analyzed	To be analyzed