373. 奇偶分割数组

373. 奇偶分割数组

 

分割一个整数数组，使得奇数在前偶数在后。

样例

样例1:

输入: [1,2,3,4]

输出: [1,3,2,4]

样例2:

输入: [1,4,2,3,5,6]

输出: [1,3,5,4,2,6]

挑战

在原数组中完成，不使用额外空间。

注意事项

答案不唯一。你只需要给出一个合法的答案。

 

public class Solution {

    /*

     * @param nums: an array of integers

     * @return: nothing

     */

    public void partitionArray(int[] nums) {

        // write your code here

        if (nums != null) {

            int flag=nums.length-1;

            for (int i = 0; i < nums.length - 1; i++) {

                if (nums[i] % 2 == 0) {

                    for (; flag >i; flag--) {

                        if (nums[flag] % 2 != 0) {

                            final int temp = nums[i];

                            nums[i] = nums[flag];

                            nums[flag] = temp;

                            break;

                        }

                    }

                    if (flag==i)return;

                }

            }

        }

    }

}