leetcode 75. Sort Colors

Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.

Here, we will use the integers 0, 1, and 2 to represent the color red, white, and blue respectively.

Note: You are not suppose to use the library's sort function for this problem. 

Example:

Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]
Follow up:

A rather straight forward solution is a two-pass algorithm using counting sort.
First, iterate the array counting number of 0's, 1's, and 2's, then overwrite array with total number of 0's, then 1's and followed by 2's.
Could you come up with a one-pass algorithm using only constant space?

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/sort-colors

/*
1.首指针pre、尾指针rear、工作指针p-三针；
2.筛选插入法-pre前为红色，rear后为蓝色 
*/
void swap(int *a,int *b)
{
        if( *a == *b )
                return;
        *a ^= *b;
        *b ^= *a;
        *a ^= *b;
}
void sortColors(int* nums, int numsSize){
        if( ! numsSize)
                return;
        //pre指向红区的下一个，rear指向蓝区前一个，p遍历
        int *pre, *rear, *p;
        pre = p = nums;
        rear = nums + numsSize - 1;

        /*pre与p之间白色或无元素（pre前面都是确定的）！p与rear之间颜色不确定！！！ */
        //遇红色0与pre位置的元素交换,然后pre、p右移；
        //遇白色1跳过
        //遇蓝色与rear位置元素交换，rear左移，注意p不动！！！
        while( p <= rear )
        {
                switch (*p)
                {
                case 0:
                        swap(p, pre);
                        ++pre;
                        ++p;
                        break;
                case 1:
                        ++p;
                        break;
                case 2:
                        swap(p,rear);//切记，新来的数值还没检查过，指针p应该留在原处
                        --rear;
                        break;
                }
        }
}