Given an array A
of non-negative integers, return an array consisting of all the even elements of A
, followed by all the odd elements of A
.
You may return any answer array that satisfies this condition.
Example 1:
Input: [3,1,2,4] Output: [2,4,3,1] The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.
Note:
1 <= A.length <= 5000
0 <= A[i] <= 5000
思路:双指针,找A[front] odd, A[back] even, 如果front < back, swap;
class Solution {
public int[] sortArrayByParity(int[] A) {
int front = 0;
int back = A.length-1;
while(front<A.length && back>=0 && front < back) {
while(front<A.length && A[front]%2 == 0){
front++;
}
while(back>=0 && A[back]%2 !=0){
back--;
}
if(front<A.length && back>=0 && front<back){
swapTwoElement(A, front, back);
front++;
back--;
}
}
return A;
}
private void swapTwoElement(int[] A, int front, int back) {
int temp = A[front];
A[front] = A[back];
A[back] = temp;
}
}