水题(辅助数组,注意vector指定分配空间大小)

922. Sort Array By Parity II

Easy

26625FavoriteShare

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) {
        int length = A.size();
        vector<int>Result(length);
        if(length == 0){return Result;}
        vector<int> odd(length / 2);//奇数数组
        vector<int> even(length / 2);//偶数数组
        int OddIndex = 0;int EvenIndex = 0;
        for(int i = 0;i < A.size();i ++){
            if(A[i] % 2 == 0){
                even[EvenIndex++] = A[i];
            }
            else{
                odd[OddIndex++] = A[i];
            }
        }
        for(int i = 0;i < length;i += 2){
            Result[i] = even[i / 2];
            Result[i + 1] = odd[i / 2];
        }
        return Result;
    }
};

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值