922. Sort Array By Parity II

#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.

这道题的意思是,把A中的奇数放在奇数位,偶数放在偶数位。首先把奇数和偶数用两个数组保存,然后再按照这个要求拼接成一个数组。

/**
 * @param {number[]} A
 * @return {number[]}
 */
var sortArrayByParityII = function(A) {
    var evenArr = [];
    var oddArr = [];
    for(var i=0;i<A.length;i++) {
        if(A[i]%2===0) {
            evenArr.push(A[i]);
        }
        else {
            oddArr.push(A[i]);
        }
    }
    var resArr = [];
    for(var j=0;j<A.length;j++) {
        if(j%2===0) {
            resArr.push(evenArr[0]);
            evenArr.splice(0,1);
        }
        else {
            resArr.push(oddArr[0]);
            oddArr.splice(0,1);
        }
    }
    return resArr;
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值