# 922. Sort Array By Parity II

**<font color=red>难度: Easy</font>**

## 刷题内容

> 原题连接

* https://leetcode.com/problems/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.
 

Note:

2 <= A.length <= 20000
A.length % 2 == 0
0 <= A[i] <= 1000
```

## 解题方案

> 思路 1
******- 时间复杂度: O(N)******- 空间复杂度: O(N)******




太简单了，2分钟bug free

```python
class Solution(object):
    def sortArrayByParityII(self, A):
        """
        :type A: List[int]
        :rtype: List[int]
        """
        if not A or len(A) == 0:
            return []
        odds = [i for i in A if i & 1]
        evens = [i for i in A if not i & 1]
        res = [0] * len(A)
        for i in range(len(A)):
            if i & 1:
                res[i] = odds.pop(0)
            else:
                res[i] = evens.pop(0)
        return res
```
