Add solution #324

Author: JoshCrozier

README.md

@@ -257,6 +257,7 @@
 318|[Maximum Product of Word Lengths](./0318-maximum-product-of-word-lengths.js)|Medium|
 319|[Bulb Switcher](./0319-bulb-switcher.js)|Medium|
 322|[Coin Change](./0322-coin-change.js)|Medium|
+324|[Wiggle Sort II](./0324-wiggle-sort-ii.js)|Medium|
 326|[Power of Three](./0326-power-of-three.js)|Easy|
 328|[Odd Even Linked List](./0328-odd-even-linked-list.js)|Medium|
 329|[Longest Increasing Path in a Matrix](./0329-longest-increasing-path-in-a-matrix.js)|Hard|

solutions/0324-wiggle-sort-ii.js

@@ -0,0 +1,21 @@
+/**
+ * 324. Wiggle Sort II
+ * https://leetcode.com/problems/wiggle-sort-ii/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]
+ *
+ * You may assume the input array always has a valid answer.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var wiggleSort = function(nums) {
+  nums.sort((a, b) => a - b);
+  const m = Math.floor((nums.length - 1) / 2);
+  for (let i = 0, l = m, r = nums.length - 1, t = [...nums]; i < nums.length; i++) {
+    nums[i] = i % 2 ? t[r--] : t[l--];
+  }
+};