Skip to content

Latest commit

 

History

History
87 lines (35 loc) · 1.21 KB

File metadata and controls

87 lines (35 loc) · 1.21 KB

中文文档

Description

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:

    <li><code>2 &lt;= A.length &lt;= 20000</code></li>
    
    <li><code>A.length % 2 == 0</code></li>
    
    <li><code>0 &lt;= A[i] &lt;= 1000</code></li>
    

 

Solutions

Python3

Java

...