【每日leetcode】39.调整数组顺序使奇数位于偶数前面

输入：nums = [1,2,3,4]
输出：[1,3,2,4] 
注：[3,1,2,4] 也是正确的答案之一。

/**
 * @author yitiaoIT
 */
class Solution {
    public int[] exchange(int[] nums) {
        int l = 0, r = nums.length - 1;
        while (l < r){ 
            if(nums[l] % 2 == 0 && nums[r] % 2 == 1)
                swap(nums,l++,r--);
            if(nums[l] % 2 == 1) l++;
            if(nums[r] % 2 == 0) r--;
        }
        return nums;
    }
    private void swap(int[] nums, int index1, int index2){
        int temp = nums[index1];
        nums[index1] = nums[index2];
        nums[index2] = temp;
    }
}