剑指 Offer 21. 调整数组顺序使奇数位于偶数前面

链接

剑指 Offer 21. 调整数组顺序使奇数位于偶数前面

思路

原地遍历将左边的偶数与右边的奇数进行交换

代码

class Solution {
    public int[] exchange(int[] nums)
    {
        int left = 0, right = nums.length - 1;
        while (left < right)
        {
            while (nums[left] % 2 == 1 && left < right)
            {
                left++;
            }
            while (nums[right] % 2 == 0 && left < right)
            {
                right--;
            }
            if (left < right)
            {
                int temp = nums[left];
                nums[left] = nums[right];
                nums[right] = temp;
            }
        }
        return nums;
    }
}