链接:http://leetcode.com/onlinejudge#question_75
原题:
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?
思路:用两端指针,把0放到左端,把2放到右端,这样就可以一遍搞定了,O(n)
代码:
class Solution {
public:
void sortColors(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int left = 0;
int right = n - 1;
if (left < right) {
while (A[left] == 0)
left++;
while (A[right] == 2)
right--;
for (int i=left; i<=right; ) {
if (A[i] == 0) {
A[i] = A[left];
A[left++] = 0;
while (A[left] == 0)
left++;
if (left > i)
i = left;
} else if (A[i] == 2) {
A[i] = A[right];
A[right--] = 2;
while (A[right] == 2)
right--;
} else
i++;
}
}
}
};