1
# Runtime: 84 ms (Top 42.8%) | Memory: 17.10 MB (Top 53.6%)
2

3

4
class Solution:
5
    def sortArrayByParity(self, A: List[int]) -> List[int]:
6
        i, j = 0, len(A) - 1
7
        while i < j:
8
            if A[i] % 2 == 1 and A[j] % 2 == 0:
9
                A[i], A[j] = A[j], A[i]
10
            i, j = i + 1 - A[i] % 2, j - A[j] % 2
11
        return A