mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-08 02:15:01 +08:00
32 lines
853 B
Markdown
32 lines
853 B
Markdown
# [922. Sort Array By Parity II](https://leetcode.com/problems/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:
|
|
|
|
```c
|
|
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
|
|
|
|
## 题目大意
|
|
|
|
要求数组中奇数下标位置上放奇数,偶数下标位置上放偶数。
|
|
|
|
## 解题思路
|
|
|
|
这题比较简单,用两个下标控制奇数,偶数放置在哪个下标即可。奇数奇数之间,偶数偶数之间的顺序可以是无序的。 |