922. Sort Array By Parity II-按奇偶排序数组 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

Solution in python:

class Solution:
    def sortArrayByParityII(self, A: List[int]) -> List[int]:
        i = 0 
        j = 1
        while i < len(A) and j < len(A):
            even = A[i]%2
            odd = A[j]%2
            if even != 0 and odd != 1:
                A[i], A[j] = A[j], A[i]
            else:
                if even == 0:
                    i += 2
                if odd == 1:
                    j += 2
        return A