1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
| class Solution {
public int[] sortArrayByParity(int[] nums) {
int i = 0, j = nums.length - 1;
while (i < j) {
while (i < j && (nums[i] & 1) == 0) {
i++;
}
while (i < j && (nums[j] & 1) == 1) {
j--;
}
swap(nums, i, j);
}
return nums;
}
private void swap(int[] nums, int i, int j) {
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
}
|
References
905. Sort Array By Parity