leetcode:(75) Sort Colors(java)

题目：

     

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?

题目描述：

      给定一个有n个颜色为红色、白色或蓝色的对象的数组，对它们进行就地排序，使相同颜色的对象相邻，颜色依次为红色、白色和蓝色。在这里，我们将使用整数0、1和2分别表示红色、白色和蓝色。

具体解题思路及代码如下：

package Leetcode_Github;

public class Sort_QuickSort_SortColors_75_1107 {
    public void sortColors(int[] nums) {
        int zero = -1, one = 0, two = nums.length;
        while (one < two) {
            if (nums[one] == 0) {
                //如果数组索引one的值等于0，把索引zero+1和one的值交换
                swap(nums, ++zero, one++);
            } else if (nums[one] == 2) {
                //如果数组索引one的值等于2，把索引two-1和one的值交换
                swap(nums, --two, one);   //注意，此时one不加1
            } else
                //如果数组索引one的值等于0，直接向后遍历数组
                one++;
        }
    }

    public void swap(int[] nums, int i, int j) {
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
}