[LeetCode] 905. Sort Array By Parity
文章目录
Problem
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
Solution
class Solution {
public int[] sortArrayByParity(int[] A) {
if (A == null || A.length < 2) return A;
int i = 0, j = 0;
while (j < A.length) {
while (i < j && A[i]%2 == 0) i++;
if (A[j]%2 == 0) {
int temp = A[i];
A[i] = A[j];
A[j] = temp;
i++;
}
j++;
}
return A;
}
}
评论
登录后参与技术讨论,分享你的经验与见解。
登录 / 注册暂无评论