leetcode 075 —— Sort Colors

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.

思路：类似快速排序，把0 集中往前放，把2集中往后放

class Solution {
public:
	void sortColors(vector<int>& nums) {
		int l = 0;
		int r = nums.size()-1;
		while (l < r){  //左边全是0；
			//print(nums);
			while (nums[l] == 0 && l < r){
				l++;
			}
			swap(&nums[l], &nums[r]);
			while (nums[r] != 0 && l < r){
				r--;
			}
			swap(&nums[l], &nums[r]);
		}
		r = nums.size() - 1;
		l = 0;
		while (nums[l] == 0) l++;
		while (l < r){
			while (nums[r] == 2 && l < r){
				r--;
			}
			swap(&nums[l], &nums[r]);
			while (nums[l] != 2 && l < r){
				l++;
			}
			swap(&nums[l], &nums[r]);
		}
	}
	void swap(int *a, int *b){
		int tmp = *a;
		*a = *b;
		*b = tmp;
	}
	
}a;