refactor 922

fishercoder1534 · fishercoder1534 · commit f2e1c3ee52dd · 2020-08-01T17:21:33.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_922.java b/src/main/java/com/fishercoder/solutions/_922.java
@@ -1,28 +1,9 @@
 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;) {
+            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];
