【剑指Offer学习】【面试题14 ：调整数组顺序使奇数位于偶数前面】

https://blog.csdn.net/derrantcm/article/details/46669015

void splitJiOu(int a[], int len) {
    if (a == NULL || 0 == len ||  1 == len) {
        return;
    }
    int sIndex = 0;
    int eIndex = len-1;
    while (sIndex < eIndex) {
        bool sNeed = false;
        bool nNeed = false;
        if(a[sIndex] % 2 == 1) {
            sIndex++;
        }
        else {
            sNeed = true;
        }
        if (a[eIndex] %2 == 0) {
            eIndex--;
        }
        else {
            nNeed = true;
        }
        if (sNeed && nNeed) {
            int temp;
            temp = a[sIndex];
            a[sIndex] = a[eIndex];
            a[eIndex] = temp;
            sIndex++;
            eIndex--;
        }
    }
}




    int jiOu[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    splitJiOu(jiOu, 10);