# [Leet Code] Sort Array By Parity

Leet Code: https://leetcode.com/problems/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`

Solution:

`class Solution(object):`

def sortArrayByParity(self, A):

"""

:type A: List[int]

:rtype: List[int]

"""

even_writer = 0

odd_writer = len(A) -1

answer = [0] * len(A)

for i in range(len(A)):

if A[i] % 2 == 0:

answer[even_writer] = A[i]

even_writer += 1

else:

answer[odd_writer] = A[i]

odd_writer -= 1

return answer