# 922.Sort Array by Parity II

**922.Sort Array by Parity II**

难度:Easy

> 给定一个非负整数数组 A， A 中一半整数是奇数，一半整数是偶数。 对数组进行排序，以便当 A\[i] 为奇数时，i 也是奇数；当 A\[i] 为偶数时， i 也是偶数。 你可以返回任何满足上述条件的数组作为答案。

```
示例：

输入：[4,2,5,7]
输出：[4,5,2,7]
解释：[4,7,2,5]，[2,5,4,7]，[2,7,4,5] 也会被接受。
 

提示：

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

代码如下：

```
class Solution {
public:
    vector<int> sortArrayByParityII(vector<int>& A) {
        vector<int> res(A.size(),0);
        int s1=0,s2=1;
        for(int i=0;i<A.size();i++)
        {
            if(A[i]&1)
            {
                res[s2]=A[i];
                s2+=2;
            }
            else
            {
                res[s1]=A[i];
                s1+=2;
            }
        }
        return res;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/922.sort_array_by_parity_ii.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.