原题:
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.
Could you come up with an one-pass algorithm using only constant space?
class Solution {
public:
void sortColors(int A[], int n) {
int count1=0,count2=0,count0=0;
int tmp;
for(int i=0; i<n; i++){
if(A[i]==0) count0++;
else if(A[i]==1) count1++;
else count2++;
}
tmp=count0;
while(tmp){
A[tmp-1]=0;
tmp--;
}
tmp = count1;
while(tmp){
A[count0-1+tmp] = 1;
tmp--;
}
tmp = count2;
while(tmp){
A[count0-1+count1+tmp]=2;
tmp--;
}
}
};
AC后我继续尝试followup里的要求,用one-pass,并且使用常数空间。
=============================================================================================================================
关于A[i++]与A[++i]的区别:
如果让i等于3,a[++i]的结果是a[4]. 但如果是a[i++].那么结果是a[3]. 第一个式子,是在本身这个语句中i的值加一,然后再运算。 而第二个式子,是用其本身的值去运算,然后再下一个句子的时候再加一
class Solution {
public:
void sortColors(int A[], int n) {
int i=-1, j=-1, k=-1;
for(int p = 0; p < n; p++){
if(A[p] == 0){
A[++k]=2;
A[++j]=1;
A[++i]=0;
}
else if (A[p] == 1){
A[++k]=2;
A[++j]=1;
}
else if (A[p] == 2) A[++k]=2;
}
}
};
时间上减少8ms。
这个答案是我在leetcode的讨论区里看到的,十分巧妙,不过挺难理解。还在消化中,等搞懂了再来更。
===============================================================================================================================
本题相当于用了三个指针,i,j,k分别指向0,1,2的队尾。每当遇到0时,大家全部自增往后指一个。真的很巧妙阿>/<