JAVA/leetcode
[LeetCode] Array - Sort Array By Parity - Two-pointer
JJunDol2
2021. 8. 5. 22:18
Move Zeroes 와 동일한 문제로 Two Pointer로 풀이
class Solution {
public int[] sortArrayByParity(int[] nums) {
int i = 0;
for (int j = i+1; j < nums.length; j++) {
if(nums[i] % 2 != 0) {
if(nums[j] % 2 != 0) {
continue;
}else {
int tmp = nums[j];
nums[j] = nums[i];
nums[i] = tmp;
}
}
i++;
}
return nums;
}
}