LeetCode——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?

解法

指针red指向开头，blue指向末尾，遍历数组，如果当前位置为0，则将当前位置的值与red位置的值互换，且red指向后一位；如果当前位置为1，则将当前位置的值与blue位置的值互换，且blue指向前一位，这里注意交换之后i要减一，因为从blue交换过来的值可能还需要再次判断来确认位置。循环到i=blue之后就可以截止了

public void sortColors(int[] nums) {
		if(nums.length==0||nums==null)
			return;
		int n=nums.length;
		int red=0,blue=n-1;
		for(int i=0;i<=blue;i++)
		{
			if(nums[i]==0)
				swap(nums,red++,i);
			else if(nums[i]==2)
				swap(nums,blue--,i--);
		}    
    }
	private void swap(int[] nums, int i, int j) {
		// TODO Auto-generated method stub
		int tmp=nums[i];
		nums[i]=nums[j];
		nums[j]=tmp;
	}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Sort Colors.
Memory Usage: 34.8 MB, less than 87.18% of Java online submissions for Sort Colors.