922. Sort Array By Parity II
程序员文章站
2024-03-06 09:48:37
...
题目
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:
2 <= A.length <= 20000
A.length % 2 == 0
0 <= A[i] <= 1000
代码
class Solution:
def sortArrayByParityII(self, A: List[int]) -> List[int]:
B=[]
C=[]
D=[]
for i in range(len(A)):
if A[i]%2==0:
B.append(A[i])
else:
C.append(A[i])
for i in range(0,len(A)//2):
D.append(B[i])
D.append(C[i])
return D
上一篇: 922. Sort Array By Parity II
下一篇: 两种JAVA实现短网址服务算法