922. 按奇偶排序数组II 添加Java版本

problems/0922.按奇偶排序数组II.md

@@ -120,6 +120,31 @@ public:
 ## Java
 
 ```java
+// 方法一
+class Solution {
+    public int[] sortArrayByParityII(int[] nums) {
+        // 分别存放 nums 中的奇数、偶数
+        int len = nums.length;
+        int evenIndex = 0;
+        int oddIndex = 0;
+        int[] even = new int[len / 2];
+        int[] odd = new int[len / 2];
+        for (int i = 0; i < len; i++) {
+            if (nums[i] % 2 == 0) {
+                even[evenIndex++] = nums[i];
+            } else {
+                odd[oddIndex++] = nums[i];
+            }
+        }
+        // 把奇偶数组重新存回 nums
+        int index = 0;
+        for (int i = 0; i < even.length; i++) {
+            nums[index++] = even[i];
+            nums[index++] = odd[i];
+        }
+        return nums;
+    }
+}
 ```
 
 ## Python
@@ -143,4 +168,3 @@ public:
 * 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
 <div align="center"><img src=../pics/公众号.png width=450 alt=> </img></div>
 
-