add another js solution to leetcode problem: No.283

solution/0200-0299/0283.Move Zeroes/README.md

@@ -77,6 +77,26 @@ class Solution {
 }
 ```
 
+### **JavaScript**
+
+```JavaScript
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var moveZeroes = function (nums) {
+    if (!nums.length) return nums;
+    let j = 0;
+    for (i = 0; i < nums.length; i++) {
+        if (nums[i]) {
+            if (i > j) [nums[i], nums[j]] = [nums[j], nums[i]];
+            j++;
+        }
+    }
+    return nums;
+};
+```
+
 ### **...**
 
 ```

solution/0200-0299/0283.Move Zeroes/README_EN.md

@@ -76,6 +76,25 @@ class Solution {
     }
 }
 ```
+### **JavaScript**
+
+```JavaScript
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var moveZeroes = function (nums) {
+    if (!nums.length) return nums;
+    let j = 0;
+    for (i = 0; i < nums.length; i++) {
+        if (nums[i]) {
+            if (i > j) [nums[i], nums[j]] = [nums[j], nums[i]];
+            j++;
+        }
+    }
+    return nums;
+};
+```
 
 ### **...**
 

solution/0200-0299/0283.Move Zeroes/Solution2.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var moveZeroes = function (nums) {
+    if (!nums.length) return nums;
+    let j = 0;
+    for (i = 0; i < nums.length; i++) {
+        if (nums[i]) {
+            if (i > j) [nums[i], nums[j]] = [nums[j], nums[i]];
+            j++;
+        }
+    }
+    return nums;
+};