题目:
Given an array with n objects colored red, white or blue, sort them 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.
题解:
class Solution {
public:
void sortColors(int A[], int n) {
if( A == NULL || n < 2 )
return;
int red = 0, blue = n - 1;
for( int i = red; i <= blue; i++ )
{
if(A[i] == 0)
swap(A[i], A[red++]);
else if( A[i] == 2 )
swap(A[i--], A[blue--]);
}
}
};
用两个数组索引red=0, blue=n-1做为指针,索引小于red的数组元素保证值为0,索引大于blue的数组元素保证值为2。遍历数组,仅当当前值为0或2时,分别与red和blue指向的数组元素进行交换。