922. Sort Array By Parity II

 

Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.

Sort the array so that whenever A[i] is odd, i is odd; and whenever A[i] is even, i is even.

You may return any answer array that satisfies this condition.

 

Example 1:

Input: [4,2,5,7]
Output: [4,5,2,7]
Explanation: [4,7,2,5], [2,5,4,7], [2,7,4,5] would also have been accepted.

 

Note:

1. 2 <= A.length <= 20000
2. A.length % 2 == 0
3. 0 <= A[i] <= 1000

 

class Solution:
    def IsOdd(self,A):
        OX=[]
        for x in A:
            if A.index[x]%2 ！=0 and x%2 ！=0 :
                OX.append(index[x])
                return OX
        
    def IsEven(self,A):
        OE=[]
        for x in A:
            if A.index[x]%2 !=1 and x%2 !=1 :
                OE.append(index[x])
                return OE
        
        
    def sortArrayByParityII(self, A):
        """
        :type A: List[int]
        :rtype: List[int]
        """
        OEV=[]
        ODD=[]
        if IsOdd(A):
            print("Odd is OK")
        else:
            ODD=IsOdd(A)
        If IsEven(A):
            print("Even is OK")
        else:
            OEV=IsEven(A)
        for i in OX:
            j=0
            A[i],A[OEV[j]]=A[OEV[j]],A[j]
        return A
            

 

Offical answer:

class Solution(object):
    def sortArrayByParityII(self, A):
        j = 1
        for i in range(0, len(A), 2):
            if A[i] % 2:
                while A[j] % 2:
                    j += 2
                A[i], A[j] = A[j], A[i]
        return A

f = 0

# 0 和 空字符当做判断条件时会被当做 False

>>> if f:
    print("OK")
else:
    print("f is false") 
f is false
>>>