905. 按奇偶排序数组

1. 题目描述

给你一个整数数组 nums，将 nums 中的的所有偶数元素移动到数组的前面，后跟所有奇数元素。

返回满足此条件的 任一数组 作为答案。

示例 1：

输入：nums = [3,1,2,4]
输出：[2,4,3,1]
解释：[4,2,3,1]、[2,4,1,3] 和 [4,2,1,3] 也会被视作正确答案。

示例 2：

输入：nums = [0]
输出：[0]

2. 题目代码

public class Solution {
    public int[] sortArrayByParity(int[] nums) {
        int low = 0;
        int high = nums.length-1;
        int temp = 0;
        while(low <= high){
            if(nums[low] % 2 != 0){
                temp = nums[low];
                nums[low] = nums[high];
                nums[high] = temp;
                high--;
                continue;
            }
            if(nums[high] % 2 == 0){
                temp = nums[low];
                nums[low] = nums[high];
                nums[high] = temp;
                low++;
                continue;

            }else{
                low++;
                high--;
            }

        }
        return nums;
    }

3. 知识点

参考快速排序思想

力扣解法（空间换时间）

class Solution {
    public int[] sortArrayByParity(int[] nums) {
        int n = nums.length, index = 0;
        int[] res = new int[n];
        for (int num : nums) {
            if (num % 2 == 0) {
                res[index++] = num;
            }
        }
        for (int num : nums) {
            if (num % 2 == 1) {
                res[index++] = num;
            }
        }
        return res;
    }
}

4. 参考

https://leetcode-cn.com/problems/sort-array-by-parity/
https://leetcode-cn.com/problems/sort-array-by-parity/solution/an-qi-ou-pai-xu-shu-zu-by-leetcode-solut-gpmm/