From 3fd951ef5fec91b3dc9be7e57aa76daf83c35f87 Mon Sep 17 00:00:00 2001
From: posper <xsduan1998@163.com>
Date: Thu, 29 Jul 2021 18:56:15 +0800
Subject: [PATCH] =?UTF-8?q?922.=20=E6=8C=89=E5=A5=87=E5=81=B6=E6=8E=92?=
 =?UTF-8?q?=E5=BA=8F=E6=95=B0=E7=BB=84II=20=E6=B7=BB=E5=8A=A0Java=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0922.按奇偶排序数组II.md | 26 +++++++++++++++++++++++-
 1 file changed, 25 insertions(+), 1 deletion(-)

diff --git a/problems/0922.按奇偶排序数组II.md b/problems/0922.按奇偶排序数组II.md
index bb609c12..d4c1be7a 100644
--- a/problems/0922.按奇偶排序数组II.md
+++ b/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>
 
-