leetcodeアルゴリズム問題--奇数が偶数の前に位置するように配列順序を調整する

原題リンク:https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/

vector<int> exchange(vector<int>& nums) {
     
    int n = nums.size();
    int low = 0, high = n - 1;
    while (low < high) {
     
        while (low < high && nums[high] % 2 == 0) high--;
        while (low < high && nums[low] % 2 == 1) low++;
        swap(nums[low],nums[high]);
    }
    return nums;
}