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

python好久不用了，撿起來很費勁。

感覺執行時間很慢，簡簡單單一個小程式跑了92ms。但leetcoe還沒有足夠資料顯示92ms是快還是慢orz

class Solution:
    def sortArrayByParity(self, A):
        """
        :type A: List[int]
        :rtype: List[int]
        """
        n=len(A)
        if n==1:
            return A
        num=0
        for i in range(0,n):
            #print(A[i])
            if A[i]%2==0:
                num=num+1
        if num==0 or num==n:
            return A;
        #print(num)
        n2=n-1
        while A[n2]%2==1:
            n2=n2-1
        for i in range(0,n-1):
            if A[i]%2==1:
                A[i],A[n2]=A[n2],A[i]
                while A[n2]%2==1:
                    n2=n2-1
            if i>=n2:
                break
        return A