leetcode

Description:

leetcode-922

Submission:

1
2
3
4
5
6
7
8
9
10
11
12
13
class :
def sortArrayByParityII(self, A: List[int]) -> List[int]:
n = len(A)
odd = []
even = [] # 用于保存奇数下标的偶数元素的下标
for i in range(0, n, 2):
if (A[i] % 2 != 0):
odd.append(i)
if (A[i+1] % 2 == 0):
even.append(i+1)
for j in range(len(odd)):
A[odd[j]], A[even[j]] = A[even[j]], A[odd[j]]
return A

Acceptance:

ac