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?

题目解析：

这道题是对颜色进行排序，颜色只有三种颜色，红（0），白（1），蓝（2）。

题目给的提示是一种O(N*N)的计数排序，需要遍历两次数组。第一次遍历数组，记录三种颜色出现的次数；再次遍历，更新数组，按照0,1,2出现的次数，更新数组元素。

class Solution {
public:
	void sortColors(int A[], int n) {
		int count[3] = {0};
		int index = 0;
		for (int i = 0; i < n; ++i) 
			++count[A[i]];
		for (int i = 0; i < 3; ++i) {
			for (int j = 0; j < count[i]; ++j) {
				A[index++] = i;
			}
		}
	}
};

下面是O(N)的算法：给两个指针，一个指向数组的第一个元素，一个指向数据的最后一个元素，对数组进行遍历，如果A[i]==0，就将A[i]向前调，和A[start]交换；如果A[i]==2，将A[i]向后调，和A[end]交换；如果A[i]==1，此时位置不变

 

class Solution {
public:
	void sortColors(int A[], int n) {
		int start = 0;
		int end = n-1;
		for(int i = 0;i <= end;++i)
		{
			if(A[i] == 0)
			{
				swap(A[i],A[start]);
				++start;
			}
			else if(A[i] == 2)
			{
				swap(A[i],A[end]);
				//为什么要--i：A[i]和A[end]交换后，从交换处开始遍历，但出了该条件，
				//for循环中i会加1，所以此处要--i
				--i; 
				--end;
			}
		}
	}
};