题目:
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的个数,然后填充数组,有没有遍历一次就可以呢?而且要求使用常数级空间
使用 r 表示红色填充的最后位置的下一个位置,使用 i 表示当前遍历的位置,那么 一定 i >= r 且 i < m
使用b表示蓝色填充的第一个位置的前一个位置,那么 一定是 i <= b (b不能超出白色位置)
其中白色的位置就是 [r + 1,i)
注意下面的用例:容易出错
[0,2] [1,2] [0,1] [1,1] [0,0] [2,2]
代码如下:
class Solution {
public:
void sortColors(vector<int>& nums) {
int m = nums.size();
if(m == 0 || m == 1)
return;
int r = 0;
int b = m - 1;
int i = 0;
while(i >= r && i <= b)
{
if(nums[i] == 2)
{
while(b >=0 && nums[b] == 2) b--;
if(b < 0) return;
if(b >= i){
swap(nums[i],nums[b]); /* 0 1 */
b--;
}
}
else if(nums[i] == 0){
while(r < m && nums[r] == 0) r++;
if(r >= m) return;
if(i < r)
i = r;
else if(i > r){
swap(nums[i],nums[r]);
r++;
}
}
else if(nums[i] == 1)
i++;
}
}
};