简单做法
class Solution:
def sortArrayByParityII(self, nums: List[int]) -> List[int]:
even = []
odd = []
for idx, num in enumerate(nums):
if num%2:
odd.append(num)
else:
even.append(num)
res = []
i = 0
j = 0
k = 0
while i < len(nums):
if i%2 != 0:
res.append(odd[j])
i += 1
j += 1
else:
res.append(even[k])
i += 1
k += 1
return res