add 905

fishercoder1534 · fishercoder1534 · commit e745948e1c72 · 2018-09-16T08:19:53.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                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|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|
 |884|[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) | O(n) | O(k) | |Easy|
 |844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | O(n) | O(1) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_905.java b/src/main/java/com/fishercoder/solutions/_905.java
@@ -0,0 +1,43 @@
+package com.fishercoder.solutions;
+
+/**
+ * 905. Sort Array By Parity
+ *
+ * Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.
+ *
+ * You may return any answer array that satisfies this condition.
+ *
+ * Example 1:
+ *
+ * Input: [3,1,2,4]
+ * Output: [2,4,3,1]
+ * The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
+ *
+ * Note:
+ *
+ * 1 <= A.length <= 5000
+ * 0 <= A[i] <= 5000
+ * */
+public class _905 {
+    public static class Solution1 {
+        public int[] sortArrayByParity(int[] A) {
+            for (int i = 0, j = A.length - 1; i < j; i++) {
+                if (A[i] % 2 == 0) {
+                    continue;
+                } else {
+                    while (j > i && A[j] % 2 != 0) {
+                        j--;
+                    }
+                    swap(A, i, j);
+                }
+            }
+            return A;
+        }
+
+        private void swap(int[] A, int i, int j) {
+            int tmp = A[i];
+            A[i] = A[j];
+            A[j] = tmp;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_905Test.java b/src/test/java/com/fishercoder/_905Test.java
@@ -0,0 +1,31 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._905;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class _905Test {
+    private static _905.Solution1 solution1;
+    private static int[] A;
+    private static int[] actual;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _905.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        A = new int[]{3, 1, 2, 4};
+        actual = solution1.sortArrayByParity(A);
+        CommonUtils.printArray(actual);
+    }
+
+    @Test
+    public void test2() {
+        A = new int[]{1, 3};
+        actual = solution1.sortArrayByParity(A);
+        CommonUtils.printArray(actual);
+    }
+}
