【LeetCode】75. Sort Colors

75. Sort Colors

Description：
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.
Difficulty：Medium
Example:

Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

Follow up:
1.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.
2.Could you come up with a one-pass algorithm using only constant space?

方法：三指针，One Pass

• Time complexity : $O\left(n\right)$
• Space complexity : $O\left(1\right)$
  思路：
  此题目相当于快排的三路快排简化版，利用三个指针将数组划分为四部分，从左向右依次是，0区域，1区域，待排序区域，2区域；
  

class Solution {
public:
	void sortColors(vector<int>& nums) {
		int l = -1, r = nums.size(), i = 0;
		while(i < r ) {
			if (nums[i] < 1) {
				swap(nums[i], nums[++l]);
				i++;
			}
			else if (nums[i] > 1)
				swap(nums[i], nums[--r]);
			else i++;
		}
	}
};