LeetCode之Sort Array By Parity II（Kotlin）

问题：
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.

---

方法：
两个index同时遍历，如果遇到两个数组元素都不符合规则则互相交换位置，遍历整个数组后输出数组则为最终结果。

具体实现：

class SortArrayByParityII {
    fun sortArrayByParityII(A: IntArray): IntArray {
        var oddIndex = 1
        var evenIndex = 0
        var temp : Int
        while(oddIndex <= A.lastIndex && evenIndex <= A.lastIndex) {
            if (A[evenIndex] % 2 != 0 && A[oddIndex] % 2 != 1) {
                temp = A[oddIndex]
                A[oddIndex] = A[evenIndex]
                A[evenIndex] = temp
            }
            if (A[evenIndex] % 2 == 0) {
                evenIndex += 2
            }
            if (A[oddIndex] % 2 == 1) {
                oddIndex += 2
            }
        }
        return A
    }
}

fun main(args: Array<String>) {
    val array = intArrayOf(4,2,5,7)
    val sortArrayByParityII = SortArrayByParityII()
    CommonUtils.printArray(sortArrayByParityII.sortArrayByParityII(array).toTypedArray())
}

有问题随时沟通

具体代码实现可以参考Github