MUYANG GUO / INDEX

LeetCode

LeetCode 905 Sort Array By Parity - Easy

905. Sort Array By Parity

·1 min read·#LeetCode#Easy#Python

905. Sort Array By Parity — Easy

Open on LeetCode

Problem

  1. Sort Array By Parity

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 <= A.length <= 5000 0 <= A[i] <= 5000

Solution

class Solution:
    def sortArrayByParity(self, A):
        
        left, right = 0, len(A) - 1
        while left <= right:
            while left <= right and A[left] % 2 == 0:
                left += 1
            while left <= right and A[right] % 2 != 0:
                right -= 1
            
            if left <= right:
                A[left], A[right] = A[right], A[left]
                left += 1
                right -= 1
        return A

Comments