题目描述
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]
解题思路
第一种方法它自己给了
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.
我们要找到的是one-pass的做法
有一个想法:
- hold一个新的数组,因为我们知道数组的大小。我们用三个指针,一个 i 指向1的第一个数,一个 j 指向1的最后一个数(初始i=0,j=n-1). k进行遍历
- k遍历整个数组,如果nums[k]是0,则nums[k]与nums[i]交换,
- 如果nums[k]==2, 则与nums[j]交换,
- (while(nums[j]==2))j–;while(nums[i]==0)i++; 如果k<i则设 k=i ;保证了nums[i]!=0;nums[j]!=2
- 否则k++,k>=j时结束循环。
循环不变量:
- i<=k<=j
外循环保证了k<j. 如果k<i则设 k=i 保证了i<=k - [0,i]之间的数为0,因为只有在nums[i]==0时我们才会进行i++
- [i,k]之间的数只能为1
如果i=k,满足
如果i<k, 假设原本已经满足,而只有当nums[k]==1时,才会进行k++操作,因此满足。 - [j, n-1] 之间的数只为2
class Solution {
public:
void sortColors(vector<int>& nums) {
int i=0,k=0,j=nums.size()-1;
while(k<=j)
{
if(nums[k]==1)
k++;
else
{
if(nums[k]==0)
swap(nums, i, k);
if(nums[k]==2)
swap(nums, k, j);
}
while(i<nums.size()&&nums[i]==0) i++;
while(0<=j&&nums[j]==2) j--;
if(k<i) k=i;
}
}
void swap(vector<int>& nums, int i, int j)
{
int temp=nums[i];
nums[i]=nums[j];
nums[j]=temp;
}
};