leetcode：905. 按奇偶排序数组

题目来源

LEETCODE

题目描述

题目解答

无脑循环

    public static  int[] sortArrayByParity(int[] A) {
        int [] res = new int[A.length];
        int left = -1;
        int right = A.length;

        for (int i = 0; i < A.length; i++){
            if (A[i] %2 == 0){
                res[++left] = A[i];
            }else{
                res[--right] = A[i];
            }
        }

        return res;
    }


    public static void main(String[] args) {
       System.out.println(Arrays.toString(sortArrayByParity(new int[]{1,-2,-3})));
    }

双指针

class Solution {
    public int[] sortArrayByParity(int[] A) {
        int left = 0;
        int right = A.length - 1;

        // 中间不用管
        while (left < right){
            while (left < right && A[left]%2 == 0){  // 第一个奇数
                left++;
            }

            while (left < right && A[right]%2 != 0){ // 第一个偶数
                right--;
            }

            if (left < right){
                int temp = A[left];
                A[left] = A[right];
                A[right] = temp;
            }
        }


        return A;
    }
}