奇偶分割数组

 1 class Solution {
 2 public:
 3     /**
 4      * @param nums: a vector of integers
 5      * @return: nothing
 6      */
 7     void partitionArray(vector<int> &nums) {
 8         // write your code here
 9         int pos = 0;    int ppos = nums.size() - 1;   int temp;
10         while (pos < ppos) {
11             while (nums[pos] % 2 != 0 && pos < ppos) {
12                 ++pos;
13             }
14             while (nums[ppos] % 2 != 1 && ppos > pos) {
15                 --ppos;
16             }
17             temp = nums[ppos];
18             nums[ppos] = nums[pos];
19             nums[pos] = temp;
20         }
21     }
22 };