classSolution{ publicint[] sortArrayByParity(int[] A) { int[] result = newint[A.length]; int j = 0; for (int i = 0; i < A.length; i++) { if (A[i]%2 == 0) { result[j] = A[i]; j++; } } for (int i = 0; i < A.length; i++) { if (A[i]%2 == 1) { result[j] = A[i]; j++; } } return result; } }
解决方案2(Python3)
1 2 3 4 5 6 7
classSolution: defsortArrayByParity(self, A): """ :type A: List[int] :rtype: List[int] """ return [i for i in A if i%2 == 0] + [i for i in A if i%2 == 1]