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.
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.
We save odd numbers and even numbers to two arrays. Then output them.
Github address: https://github.com/tinyfool/leetcode/tree/master/src/p0922
To find other sort problems, see also Sort algorithms and problems.