Add solution #283

Author: JoshCrozier

solutions/0283-move-zeroes.js

@@ -3,7 +3,8 @@
  * 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.
+ * 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.
  */
@@ -15,15 +16,7 @@
 var moveZeroes = function(nums) {
   for (let i = 0, j = 0; i < nums.length; i++) {
     if (nums[i] !== 0) {
-      swap(nums, i, j++);
+      [nums[i], nums[j++]] = [nums[j], nums[i]];
     }
   }
-
-  return nums;
 };
-
-function swap(nums, i, j) {
-  const temp = nums[i];
-  nums[i] = nums[j];
-  nums[j] = temp;
-}