add 922

fishercoder1534 · fishercoder1534 · commit 20f147eb9e83 · 2018-10-20T09:31:39.000-07:00
diff --git a/README.md b/README.md
@@ -29,6 +29,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_922.java) | O(n) | O(1) | |Easy|
 |917|[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_917.java) | O(n) | O(n) | |Easy|
 |900|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) | O(n) | O(1) | |Easy|
 |896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | O(n) | O(1) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_922.java b/src/main/java/com/fishercoder/solutions/_922.java
@@ -0,0 +1,43 @@
+package com.fishercoder.solutions;
+
+/**
+ * 922. Sort Array By Parity II
+ *
+ * Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.
+ * Sort the array so that whenever A[i] is odd, i is odd; and whenever A[i] is even, i is even.
+ * You may return any answer array that satisfies this condition.
+ *
+ * Example 1:
+ *
+ * Input: [4,2,5,7]
+ * Output: [4,5,2,7]
+ * Explanation: [4,7,2,5], [2,5,4,7], [2,7,4,5] would also have been accepted.
+ *
+ *
+ * Note:
+ * 2 <= A.length <= 20000
+ * A.length % 2 == 0
+ * 0 <= A[i] <= 1000
+ * */
+public class _922 {
+    public static class Solution1 {
+        public int[] sortArrayByParityII(int[] A) {
+            for (int i = 0, j = 1; i < A.length - 1 && j < A.length;) {
+                if (A[i] % 2 != 0 && A[j] % 2 == 0) {
+                    int tmp = A[i];
+                    A[i] = A[j];
+                    A[j] = tmp;
+                    i += 2;
+                    j += 2;
+                }
+                while (i < A.length - 1 && A[i] % 2 == 0) {
+                    i += 2;
+                }
+                while (j < A.length && A[j] % 2 != 0) {
+                    j += 2;
+                }
+            }
+            return A;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_922Test.java b/src/test/java/com/fishercoder/_922Test.java
@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._922;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _922Test {
+    private static _922.Solution1 solution1;
+    private static int[] A;
+    private static int[] result;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _922.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        A = new int[]{4, 2, 5, 7};
+        result = solution1.sortArrayByParityII(A);
+        CommonUtils.printArray(result);
+    }
+
+    @Test
+    public void test2() {
+        A = new int[]{3, 1, 4, 2};
+        result = solution1.sortArrayByParityII(A);
+        CommonUtils.printArray(result);
+    }
+}
