feat: add python and java solutions to leetcode problem: No.0283

Author: yanglbme

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

@@ -30,15 +30,49 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def moveZeroes(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        if not nums:
+            return
+        n = len(nums)
+        zero_count = 0
+        for i in range(n):
+            if nums[i] == 0:
+                zero_count += 1
+            else:
+                nums[i - zero_count] = nums[i]
+        while zero_count > 0:
+            nums[n - zero_count] = 0
+            zero_count -= 1
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public void moveZeroes(int[] nums) {
+        int n;
+        if (nums == null || (n = nums.length) < 1) {
+            return;
+        }
+        int zeroCount = 0;
+        for (int i = 0; i < n; ++i) {
+            if (nums[i] == 0) {
+                ++zeroCount;
+            } else {
+                nums[i - zeroCount] = nums[i];
+            }
+        }
+        while (zeroCount > 0) {
+            nums[n - zeroCount--] = 0;
+        }
+    }
+}
 ```
 
 ### **...**

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

@@ -28,13 +28,47 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def moveZeroes(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        if not nums:
+            return
+        n = len(nums)
+        zero_count = 0
+        for i in range(n):
+            if nums[i] == 0:
+                zero_count += 1
+            else:
+                nums[i - zero_count] = nums[i]
+        while zero_count > 0:
+            nums[n - zero_count] = 0
+            zero_count -= 1
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public void moveZeroes(int[] nums) {
+        int n;
+        if (nums == null || (n = nums.length) < 1) {
+            return;
+        }
+        int zeroCount = 0;
+        for (int i = 0; i < n; ++i) {
+            if (nums[i] == 0) {
+                ++zeroCount;
+            } else {
+                nums[i - zeroCount] = nums[i];
+            }
+        }
+        while (zeroCount > 0) {
+            nums[n - zeroCount--] = 0;
+        }
+    }
+}
 ```
 
 ### **...**

solution/0200-0299/0283.Move Zeroes/Solution.java

@@ -1,18 +1,19 @@
 class Solution {
     public void moveZeroes(int[] nums) {
-        if (nums == null || nums.length <= 1) {
+        int n;
+        if (nums == null || (n = nums.length) < 1) {
             return;
         }
-        int count = 0, length = nums.length - 1;
-        for (int i = 0; i <= length; i++) {
+        int zeroCount = 0;
+        for (int i = 0; i < n; ++i) {
             if (nums[i] == 0) {
-                count++;
+                ++zeroCount;
             } else {
-                nums[i - count] = nums[i];
+                nums[i - zeroCount] = nums[i];
             }
         }
-        while (count-- > 0) {
-            nums[length - count] = 0;
+        while (zeroCount > 0) {
+            nums[n - zeroCount--] = 0;
         }
     }
 }

solution/0200-0299/0283.Move Zeroes/Solution.py

@@ -0,0 +1,17 @@
+class Solution:
+    def moveZeroes(self, nums: List[int]) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        if not nums:
+            return
+        n = len(nums)
+        zero_count = 0
+        for i in range(n):
+            if nums[i] == 0:
+                zero_count += 1
+            else:
+                nums[i - zero_count] = nums[i]
+        while zero_count > 0:
+            nums[n - zero_count] = 0
+            zero_count -= 1