【刷leetcode，拿Offer-026】922. Sort Array By Parity II

题目链接：https://leetcode.com/problems/sort-array-by-parity-ii/

题面：

922. Sort Array By Parity II

Easy

29629FavoriteShare

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

题意：构造，让奇数下标上的数是奇数，偶数下标上的数是偶数。

解题：逐个放就好了。

代码：

class Solution {
public:
    vector<int> sortArrayByParityII(vector<int>& A) {
        vector <int> B(A.size());
        int a1=0,a2=1;
        for(int i=0;i<A.size();i++){
            if(A[i]%2==0){B[a1]=A[i];a1+=2;}
            else{B[a2]=A[i];a2+=2;}
        }
        return B;
    }
};