奇数在前，偶数在后，时间复杂度，空间复杂度最小

int method(int x[], int n)
{
    int low = 0, high = n - 1;
    while (low < high)
    {
        while (x[high] % 2 != 0)
            high--;
        while (x[low] % 2 != 1)
        {
            low++;
        }
        if (low < high)
        {
            swap(x[low],x]high);
        }
        low++;
        high--;
    }
}