std::vector<int> sortArrayByParityII(std::vector<int>& nums){
int even_index = 0;
int odd_index = 1;
std::vector<int> res; res.resize(nums.size());
for(int i = 0; i < nums.size(); i++){
if(nums[i] % 2 == 0){
res[even_index] = nums[i];
even_index += 2;
}
else if(nums[i] % 2 == 1){
res[odd_index] = nums[i];
odd_index += 2;
}
}
return res;
}
'Problem set' 카테고리의 다른 글
[LeetCode] Maximum Subarray - Kadane Algorithm (0) | 2022.09.21 |
---|---|
[LeetCode] Sort Colors (0) | 2022.08.30 |
[LeetCode] Find Pivot Index (0) | 2022.08.26 |
[LeetCode] Move Zeroes (0) | 2022.08.26 |
[백준] 1967 트리의 지름 (0) | 2021.02.20 |