905. Sort Array By Parity

1. Question:

905. Sort Array By Parity

https://leetcode.com/problems/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. 1 <= A.length <= 5000
  2. 0 <= A[i] <= 5000

2. Solution:

class Solution:
    def sortArrayByParity(self, A):
        """
        :type A: List[int]
        :rtype: List[int]
        """
        size = len(A)
        if size <= 1:
            return A

        i = 0
        j = size - 1
        while i <= j:

            while i <= j and A[i] % 2 == 0:
                i += 1

            while i <= j and A[j] % 2 == 1:
                j -= 1

            if i < j:
                A[i], A[j] = A[j], A[i]
        return A

3. Complexity Analysis

Time Complexity : O(N)

Space Complexity: O(1)

猜你喜欢

转载自www.cnblogs.com/ordili/p/9992057.html