LeetCode Sort Colors

标签：leetcode   排序   algorithm   

题目链接：https://oj.leetcode.com/problems/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.

手写快排就完了

class Solution {
public:
    void swap(int &a,int &b)
    {
	    int t=a;
	    a=b;
	    b=t;
    }
    void ksort(int l,int h,int a[])
    {
    	if(h<l+2)
    		return;
    	int e=h,p=l;
    	while(l<h)
    	{
    		while(++l<e&&a[l]<=a[p]);
    		while(--h>p&&a[h]>=a[p]);
    		if(l<h)
    		{
    			swap(a[l],a[h]);
    		}
    	}
    	swap(a[h],a[p]);
    	ksort(p,h,a);
    	ksort(l,e,a);
    }
    void sortColors(int A[], int n) {
        ksort(0,n,A);
    }
};

LeetCode Sort Colors,布布扣,bubuko.com

LeetCode Sort Colors

标签：leetcode   排序   algorithm   

原文地址：http://blog.csdn.net/asdfghjkl1993/article/details/27982121