LeetCode 922. Sort Array By Parity II

Description:
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.
Solution:
简单的题目，双指针解决，遍历一次就行，O(n)

public int[] sortArrayByParityII(int[] A) {
        int[] result = new int[A.length];
        if(A.length == 0) return result;
        int even = 0;
        int odd = 1;
        for(int a : A) {
            if(a % 2 == 0) {
                result[even] = a;
                even += 2;
            } else {
                result[odd] = a;
                odd += 2;
            }
        }
        return result;
    }

容许我这几天拿简单的题目摸鱼 ~ 要写论文