class Solution(object):
# def sortArrayByParityII(self, A):
# N = len(A)
# ans = [None] * N
# t = 0
# for i, x in enumerate(A):
# if x % 2 == 0:
# ans[t] = x
# t += 2
# t = 1
# for i, x in enumerate(A):
# if x % 2 == 1:
# ans[t] = x
# t += 2
# # We could have also used slice assignment:
# # ans[::2] = (x for x in A if x % 2 == 0)
# # ans[1::2] = (x for x in A if x % 2 == 1)
# return ans
def sortArrayByParityII(self, A):
odd = 1
for i in xrange(0, len(A), 2):
if A[i] % 2:
while A[odd] % 2:
odd += 2
A[i], A[odd] = A[odd], A[i]
return A
Download Sort Array By Parity II.pyLeetcode 922 Sort Array By Parity II problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.