码迷,mamicode.com
首页 > 编程语言 > 详细

[LeetCode&Python] Problem 905: Sort Array By Parity

时间:2018-09-16 15:28:45      阅读:272      评论:0      收藏:0      [点我收藏+]

标签:beginning   list   for   ble   code   problem   and   class   memory   

Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.

You may return any answer array that satisfies this condition.

 

Example 1:

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.

 

Note:

  1. 1 <= A.length <= 5000
  2. 0 <= A[i] <= 5000

 

Try:

In the beginning, I want to use recursive method to solve this problem.

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:])

 

The problem is that this method needs too much memory space.

 

Solution:

Just use one line, you can solve this problem.

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

标签:beginning   list   for   ble   code   problem   and   class   memory   

原文地址:https://www.cnblogs.com/chiyeung/p/9655829.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!