leetcode-905-陣列排序
阿新 • • 發佈:2018-11-04
法一:對陣列進行排序,將所有的偶數放到奇數的前面,我們可以考慮使用兩個for迴圈,先將所有的偶數存到陣列中,在將所有的奇數存進去
class Solution { public int[] sortArrayByParity(int[] A) { int[] B = new int[A.length]; int t = 0; for(int i = 0;i<A.length;i++){ if(A[i]%2 == 0) B[t++] = A[i]; } for(int i = 0;i<A.length;i++){ if(A[i]%2 != 0) B[t++] = A[i]; } return B; } }
法二:通過比較器對陣列進行排序
class Solution { public int[] sortArrayByParity(int[] A) { Integer[] B = new Integer[A.length]; for (int t = 0; t < A.length; ++t) B[t] = A[t]; Arrays.sort(B, (a, b) -> Integer.compare(a%2, b%2)); for (int t = 0; t < A.length; ++t) A[t] = B[t]; return A; /* Alternative: return Arrays.stream(A) .boxed() .sorted((a, b) -> Integer.compare(a%2, b%2)) .mapToInt(i -> i) .toArray(); */ } }