C++ 算法：奇数偶数排序 - 代码实现及解析

#include #include #include using namespace std;

int main() { int n; cin >> n;

vector<int> nums(n);
for (int i = 0; i < n; i++) {
    cin >> nums[i];
}

vector<int> odd_nums;
vector<int> even_nums;

for (int i = 0; i < n; i++) {
    if (nums[i] % 2 == 0) {
        even_nums.push_back(nums[i]);
    } else {
        odd_nums.push_back(nums[i]);
    }
}

sort(odd_nums.begin(), odd_nums.end());
sort(even_nums.begin(), even_nums.end());

for (int i = 0; i < odd_nums.size(); i++) {
    cout << odd_nums[i] << " ";
}

for (int i = 0; i < even_nums.size(); i++) {
    cout << even_nums[i] << " ";
}

return 0;

}