class Solution {
public:
vector<int> exchange(vector<int>& nums) {
int low = 0, fast = 0;
while (fast < nums.size()) {
if (nums[fast] & 1) {
swap(nums[low], nums[fast]);
low ++;
}
fast ++;
}
return nums;
}
};
class Solution {
public:
vector<int> exchange(vector<int>& nums) {
sort(nums.begin(),nums.end(),[](int a,int b){return a%2>b%2;});
return nums;
}
};