#用两个列表分别用来存奇数和偶数,最后奇数列表和偶数列表连接起来就行,时间复杂度满足,就是空间浪费了挺多
class Solution:
def reOrderArrayTwo(self , array: List[int]) -> List[int]:
# write code here
l , l2 = [] , []
for i in array:
if i % 2 == 0:
l.append(i)
else:
l2.append(i)
return l2+l