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

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

难度简单

输入一个整数数组，实现一个函数来调整该数组中数字的顺序，使得所有奇数位于数组的前半部分，所有偶数位于数组的后半部分。

示例：

输入：nums = [1,2,3,4]

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

注：[3,1,2,4] 也是正确的答案之一。

提示：

1. 0 <= nums.length <= 50000

2. 1 <= nums[i] <= 10000

class Solution {

    public int[] exchange(int[] nums) {

        int index = 0;

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

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

                    int value=nums[i];

                    for (int j = i; j > index; j--){

                        nums[j]=nums[j-1];

                    }

                    nums[index]=value;

                    index++;

                }

            }

         return nums;

    }

}

class Solution {

    public int[] exchange(int[] nums) {

        int start = 0;

            int end = nums.length - 1;

            while (end > start) {

                while ((nums[start] & 1) == 1) {

                    start++;

                    if (start>=end){

                        return nums;

                    }

                }

                while ((nums[end] & 1) == 0) {

                    end--;

                     if (start>=end){

                        return nums;

                    }

                }

            

                    int value = nums[start];

                    nums[start] = nums[end];

                    nums[end] = value;

                

            }

        return nums;

    }

}