扫两遍的话,用计数排序。
class Solution {
public:
void sortColors(int A[], int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
vector<int> cnt(4, 0);
for(int i = 0; i < n; i++){
cnt[A[i]]++;
}
for(int i = 0, j = 0; i < 3; i++){
while(cnt[i] != 0){
A[j++] = i;
cnt[i]--;
}
}
}
};
扫一遍的话,做法有点巧,在数组头尾设置两个指针,再设置一个index指针来遍历数组。
每次遇到0,与头指针交换,头指针+1;每次遇到2,与尾指针交换,尾指针-1;遇到1则继续遍历。
注意结束遍历的条件和当index指针小于头指针的情况该怎么处理就差不多了。
class Solution {
public:
void sortColors(int A[], int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int srt = 0, end = n-1, index = 0;
while(index <= end && srt <= end){
if(A[index] == 2){
swap(A[index], A[end]);
end--;
}
else if(A[index] == 0){
swap(A[index], A[srt]);
srt++;
index = (index < srt)?srt:index;
}
else index++;
}
}
};