☆打卡算法☆LeetCode 75、颜色分类 算法解析

示例 1：
输入： nums = [2,0,2,1,1,0]
输出： [0,0,1,1,2,2]

示例 2：
输入： nums = [2,0,1]
输出： [0,1,2]

public class Solution {
        public void SortColors(int[] nums)
        {
            int left = 0;
            int right = nums.Length - 1;

            //检查中间的颜色，如果有不是1的，则往边界外放
            for (int i = left; i <= right; i++)
            {
                if (left >= right)
                    break;
                if (nums[i] == 0)
                {
                    int a = nums[i];
                    int b = nums[left];
                    nums[i] = b;
                    nums[left] = a;
                    left++;
                    while (right > left)
                    {
                        if (nums[left] != 0)
                            break;
                        left++;
                    }
                    i = left;
                }
                if (nums[i] == 2)
                {
                    int a = nums[i];
                    int b = nums[right];
                    nums[i] = b;
                    nums[right] = a;
                    right--;
                    while (right > left)
                    {
                        if (nums[right] != 2)
                            break;
                        right--;
                    }
                    //如果换进去的是1，说明还要再换
                    if (a != 1 )
                        i--;
                }

            }
        }
}