[LeetCode&Python] Problem 905: Sort Array By Parity
2021-06-26 23:04
标签：beginning list for ble code problem and class memory Given an array You may return any answer array that satisfies this condition. Example 1: Note: Try: In the beginning, I want to use recursive method to solve this problem. The problem is that this method needs too much memory space. Solution: Just use one line, you can solve this problem. [LeetCode&Python] Problem 905: Sort Array By Parity 标签：beginning list for ble code problem and class memory 原文地址：https://www.cnblogs.com/chiyeung/p/9655829.htmlA of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.Input: [3,1,2,4]
Output: [2,4,3,1]
The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
1 0 class Solution:
def sortArrayByParity(self, A):
"""
:type A: List[int]
:rtype: List[int]
"""
if not A: return []
if A[0]%2!=0:
return self.sortArrayByParity(A[1:])+[A[0]]
return [A[0]]+self.sortArrayByParity(A[1:])
class Solution:
def sortArrayByParity(self, A):
"""
:type A: List[int]
:rtype: List[int]
"""
return [x for x in A if x%2==0]+[x for x in A if x%2!=0]
文章标题：[LeetCode&Python] Problem 905: Sort Array By Parity
文章链接：http://soscw.com/essay/98205.html