leetcode 75: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.

click to show follow up.

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 an one-pass algorithm using only constant space?

思路：

从左往右扫描，遇到0放左边，遇到2放右边

时间复杂度：O(n)

实现如下：

class Solution {
public:
	void sortColors(vector<int>& nums) {
		int size = nums.size();
		if (size < 2) return;
		int left=0, right=size-1,index=0;
		while (index <= right)
		{
			if (nums[left] == 0)
			{
				++left;
				++index;
				continue;
			}
			if (nums[right] == 2)
			{
				--right;
				continue;
			}
			if (nums[left] == 2 && nums[right] == 0)
			{
				swap(nums[left++], nums[right--]);
				if(index<left) ++index;
				continue;
			}
			else if (nums[left] == 2)
			{
				swap(nums[left], nums[right--]);
				continue;
			}
			else if (nums[right] == 0)
			{
				swap(nums[left++], nums[right]);
				if(index<left) ++index;
				continue;
			}
			if (nums[index] == 0) swap(nums[index++], nums[left++]);
			else if (nums[index] == 2) swap(nums[index++], nums[right--]);
			else ++index;
		}
	}
};

唉，这段代码写的真水。

下面来看看别人家赏心悦目的代码：

 class Solution {
    public:
        void sortColors(vector<int> &A) {
            int n=A.size();
            int second=n-1, zero=0;
            for (int i=0; i<=second; i++) {
                while (A[i]==2 && i<second) swap(A[i], A[second--]);
                while (A[i]==0 && i>zero) swap(A[i], A[zero++]);
            }
        }
    };

不得不说这段代码写的精妙，不过时间可能比上面的解法长点。因为右边的0也是先换到中间，在换到左边，同样右边的2也可能先换到中间，再换到右边。