Add solution #283

Author: JoshCrozier

README.md

@@ -20,6 +20,7 @@
 226|[Invert Binary Tree](./0226-invert-binary-tree.js)|Easy|
 263|[Ugly Number](./0263-ugly-number.js)|Easy|
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|
+283|[Move Zeroes](./0283-move-zeroes.js)|Easy|
 345|[Reverse Vowels of a String](./0345-reverse-vowels-of-a-string.js)|Easy|
 350|[Intersection of Two Arrays II](./0350-intersection-of-two-arrays-ii.js)|Easy|
 387|[First Unique Character in a String](./0387-first-unique-character-in-a-string.js)|Easy|

solutions/0283-move-zeroes.js

@@ -0,0 +1,29 @@
+/**
+ * 283. Move Zeroes
+ * https://leetcode.com/problems/move-zeroes/
+ * Difficulty: Easy
+ *
+ * Given an integer array `nums`, move all `0`'s to the end of it while maintaining the relative order of the non-zero elements.
+ *
+ * Note that you must do this in-place without making a copy of the array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var moveZeroes = function(nums) {
+  for (let i = 0, j = 0; i < nums.length; i++) {
+    if (nums[i] !== 0) {
+      swap(nums, i, j++);
+    }
+  }
+
+  return nums;
+};
+
+function swap(nums, i, j) {
+  const temp = nums[i];
+  nums[i] = nums[j];
+  nums[j] = temp;
+}