solve problem Move Zeroes

Author: P-ppc

README.md

@@ -35,6 +35,7 @@ All solutions will be accepted!
 |520|[Detect Capital](https://leetcode-cn.com/problems/detect-capital/description/)|[java/py/js](./algorithms/DetectCaptial)|Easy|
 |682|[BaseBall Game](https://leetcode-cn.com/problems/baseball-game/description/)|[java/py/js](./algorithms/BaseBallGame)|Easy|
 |404|[Sum Of Left Leaves](https://leetcode-cn.com/problems/sum-of-left-leaves/description/)|[java/py/js](./algorithms/SumOfLeftLeaves)|Easy|
+|283|[Move Zeroes](https://leetcode-cn.com/problems/move-zeroes/description/)|[java/py/js](./algorithms/MoveZeroes)|Easy|
 
 # Database
 |596|[Big Countries](https://leetcode-cn.com/problems/big-countries/description/)|[mysql](./database/BigCountries)|Easy|

algorithms/MoveZeroes/README.md

@@ -0,0 +1,2 @@
+# Move Zeroes
+This problem is easy to solve

algorithms/MoveZeroes/Solution.java

@@ -0,0 +1,16 @@
+class Solution {
+    public void moveZeroes(int[] nums) {
+        int length = nums.length;
+        for (int i = 0; i < length; i++) {
+            if (nums[i] != 0) continue;
+            for (int j = i; j < length; j++) {
+                if (nums[j] != 0) {
+                    nums[i] = nums[i] + nums[j];
+                    nums[j] = nums[i] - nums[j];
+                    nums[i] = nums[i] - nums[j];
+                    break;
+                }
+            }
+        }
+    }
+}

algorithms/MoveZeroes/solution.js

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

algorithms/MoveZeroes/solution.py

@@ -0,0 +1,15 @@
+class Solution(object):
+    def moveZeroes(self, nums):
+        """
+        :type nums: List[int]
+        :rtype: void Do not return anything, modify nums in-place instead.
+        """
+        length = len(nums)
+        for i in range(0, length):
+            if nums[i] != 0:
+                continue
+            for j in range(i, length):
+                if nums[j] != 0:
+                    nums[i], nums[j] = nums[j], nums[i]
+                    break
+