LintCode-373.奇偶分割数组

public class Solution {
    /**
     * @param nums: an array of integers
     * @return: nothing
     */
    public void partitionArray(int[] nums) {
        // write your code here;
        for(int i = 0, j = nums.length - 1; i < j; i++){
            if(nums[i] % 2 == 0){
                while(nums[j]%2 == 0){
                    if((--j)< i) return;   
                }
                int temp = nums[i];nums[i] = nums[j]; nums[j] = temp;
            } 
        }
    }
}