【Java】【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?

思路解析：

如果只能扫一遍，很容易想到的就是左边存放0和1，右边存放2，两边往中间靠。
设置两个index，left记录第一个1的位置，left左边为0，right记录第一个非2的位置，right右边为2。
然后使用cur从头到尾扫一遍，直到与right相遇。
cur遇到0就换到左边去，遇到2就换到右边去，遇到1就跳过。
需要注意的是：由于left记录第一个1的位置，因此nums[left]与nums[cur交换后]，nums[left]为0，nums[cur]为1，因此cur++;
而right记录第一个非2的位置，可能为0或1，因此nums[right]与nums[cur]交换后，nums[right]为2,nums[cur]为0或1，cur不能前进，要后续判断。

代码如下：

public class SortColors
{

    public static void main(String[] args)
    {
        /**
         * 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.
         */
        /**
         * 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?
         */
        /**
         * Example:
         * Input: [2,0,2,1,1,0]
         * Output: [0,0,1,1,2,2]
         */
        int[] nums = { 2, 0, 2, 1, 1, 0 };
        sortColors(nums);
        LeetCodeUtil.printIntArray(nums, nums.length);
    }

    public static void sortColors(int nums[])
    {
        if (nums == null || nums.length <= 1)
        {
            return;
        }
        int cur = 0, left = 0, right = nums.length - 1;
        while (cur <= right)
        {
            if (nums[cur] == 0)
            {
                swap(nums, cur++, left++);
            }
            else if (nums[cur] == 2)
            {
                swap(nums, cur, right--);
            }
            else
            {
                cur++;
            }
        }
    }

    private static void swap(int[] nums, int i, int j)
    {
        int tmp = nums[i];
        nums[i] = nums[j];
        nums[j] = tmp;
    }
}