905. Sort Array By Parity

#利用快速排序的思想，序列两边同时进行比较，时间复杂度为：O(n)

class Solution:
    def sortArrayByParity(self, A: List[int]) -> List[int]:
        i = 0
        j = len(A)-1
        L_num = A[j] #取出最后一个值
        while i < j:
            #左边移动判定
            while i < j and A[i] % 2 == 0:
                i += 1
            A[j] = A[i] #奇数换到后面
            
            #右边移动判定
            while i < j and A[j] % 2 == 1:
                j -= 1
            A[i] = A[j] #偶数换到前面
        A[i] = L_num 
        return A