lintcode-奇偶分割数组-373

class Solution {
public:
   
    void partitionArray(vector<int> &nums) {
        int mid=-1;
        for(auto &e:nums){
            if(e&1)
                swap(e,nums[++mid]);
        }
    }
};