75. Sort Colors
Medium
1557148FavoriteShare
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?
解题思路是依次历每一位,检查后面是否有比他小的数,有就换到前面来。
class Solution {
public:
void sortColors(vector<int>& nums) {
for(int i=0;i<nums.size();i++)
{
int p0=i;
int p1=i;
int p2=i;
while(p0<nums.size()&&nums[p0]!=0){p0++;}
while(p1<nums.size()&&nums[p1]!=1){p1++;}
while(p2<nums.size()&&nums[p2]!=2){p2++;}
if(nums[i]==0){}
else if(nums[i]==1)
{
if(p0==nums.size()){}
else if(p0>i)swap(nums[p0],nums[i]);
}
else if(nums[i]==2)
{
if(p0==nums.size()&&p1==nums.size())return;
else if(p0!=nums.size()&&p0>i)swap(nums[p0],nums[i]);
else if(p1!=nums.size()&&p1>i)swap(nums[p1],nums[i]);
}
}
return;
}
优化了一下,代码如下:
class Solution {
public:
void sortColors(vector<int>& nums) {
for(int i=0;i<nums.size();i++)
{
if(nums[i]==0){}
else if(nums[i]==1)
{
int p0=i;
while(p0<nums.size()&&nums[p0]!=0){p0++;}
if(p0==nums.size()){}
else if(p0>i)swap(nums[p0],nums[i]);
}
else if(nums[i]==2)
{
int p0=i;
while(p0<nums.size()&&nums[p0]!=0){p0++;}
if(p0==nums.size())
{
int p1=i;
while(p1<nums.size()&&nums[p1]!=1){p1++;}
if(p1==nums.size())return;
else swap(nums[p1],nums[i]);
}
else swap(nums[p0],nums[i]);
}
}
return;
}
};
};