LeetCode 280 | Wiggle Sort | Solution Explained (Java + Whiteboard)
Running Time: O(N)
Space Complexity: O(1)
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]
Always be pluggin:
Slack Channel: https://join.slack.com/t/xavierelonle...
Github: https://github.com/xavierelon1
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-524144127
Twitter: / elon_xavier