LeetCode-922. Sort Array By Parity II

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:

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

题解：

class Solution {public: vector sortArrayByParityII(vector& A) { int n = A.size(); vector odd, even; for (int i = 0; i < n; i++) { if (A[i] % 2 == 0) { even.push_back(A[i]); } else { odd.push_back(A[i]); } } A.clear(); for (int i = 0; i < n; i++) { if (i % 2 == 0) { A.push_back(even.back()); even.pop_back(); } else { A.push_back(odd.back()); odd.pop_back(); } } return A; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。