LeetCode 905. 按奇偶排序数组

示例：

输入：[3,1,2,4]
输出：[2,4,3,1]
输出 [4,2,3,1]，[2,4,1,3] 和 [4,2,1,3] 也会被接受。

class Solution:
    def sortArrayByParity(self, A: [int]) -> [int]:
        # #双指针
        # left = 0
        # right = len(A)-1
        # while left != right:
        #     if A[left] %2 == 0:
        #         left += 1
        #         continue
        #     if A[right] %2 == 1:
        #         right -= 1
        #         continue
        #     A[left], A[right] = A[right], A[left]
        #     left += 1
        #     if left == right:break
        #     right -= 1
        # return A
        #数组
        ret = []
        for i in A:
            if i %2 == 0:
                ret.insert(0,i)
            else:
                ret.append(i)
        return ret