leetcode

Description:

leetcode-905

Submission:

1
2
3
4
5
6
7
8
9
10
class :
def sortArrayByParity(self, A: List[int]) -> List[int]:
even = []
odd = []
for i in A:
if (i % 2 == 0):
even.append(i)
else:
odd.append(i)
return even + odd

Acceptance:

ac

思路很直接,但是缺陷也很明显,存储开销比较大。