Lintcode：奇偶分割数组

问题：

分割一个整数数组，使得奇数在前偶数在后。

样例:

样例1:

输入: [1,2,3,4]
输出: [1,3,2,4]

样例2:

输入: [1,4,2,3,5,6]
输出: [1,3,5,4,2,6]

python：

class Solution:
    """
    @param: nums: an array of integers
    @return: nothing
    """
    def partitionArray(self, nums):
        # write your code here
        if nums == None or len(nums) == 1:
            return
        start = 0
        end = len(nums)-1
        while start < end:
            while nums[start]%2 == 1:
                start += 1
            while nums[end]%2 == 0:
                end -= 1
            if start < end:
                temp = nums[end]
                nums[end] = nums[start]
                nums[start] = temp

C++：

class Solution {
public:
    /*
     * @param nums: an array of integers
     * @return: nothing
     */
    void partitionArray(vector<int> &nums) {
        // write your code here
        if(nums.size() == 0 || nums.size() == 1)
        {
            return;
        }
        int start = 0;
        int end = nums.size()-1;
        while(start < end)
        {
            while(nums[start]%2 == 1)
            {
                start++;
            }
            while(nums[end]%2 == 0)
            {
                end--;
            }
            if(start < end)
            {
                long temp = nums[start];
                nums[start] = nums[end];
                nums[end] = temp;
            }
        }
    }
};