[LeetCode] 922. Sort Array By Parity 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:

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

Github 同步地址:

https://github.com/grandyang/leetcode/issues/922

类似题目：

Sort Array By Parity

参考资料：

https://leetcode.com/problems/sort-array-by-parity-ii/

LeetCode All in One 题目讲解汇总(持续更新中...)

[LeetCode] 922. Sort Array By Parity II 按奇偶排序数组之二

原文：https://www.cnblogs.com/grandyang/p/11796032.html