【Leetcode】Sort Colors

最新推荐文章于 2019-05-21 15:41:52 发布

ljffdream

最新推荐文章于 2019-05-21 15:41:52 发布

阅读量331

点赞数

分类专栏： Medium leetcode Two Pointers Sort Array 文章标签： leetcode

本文链接：https://blog.csdn.net/ljffdream/article/details/41785947

版权

leetcode 同时被 3 个专栏收录

91 篇文章 0 订阅

订阅专栏

Medium

46 篇文章 0 订阅

订阅专栏

Array

38 篇文章 0 订阅

订阅专栏

【题目】

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.

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?

【思路】

count sort

两遍遍历，第一遍遍历输出0,1，2的个数，用三个变量记录下来

第二遍循环，按数量录入

【通过的代码】

	public static void sortColor(int A[]){
		
		int zero=0,one=0,two=0;
		for(int a:A){
		if(a==0) zero++;
		else if(a==1) one++;
		else two++;
		}
		int i=0;
		for(i=0;i<zero;i++){
			A[i]=0;
		}
		int j=0;
		for(;j<one;j++){
			A[i+j]=1;
		}
		int k=0;
		for(;k<two;k++)
		{
			A[i+j+k]=2;
		}
	   
	}

【代码】

   public void sortColors(int[] A) {


    int i=-1, j=-1, k=-1;

    for(int p = 0; p < A.length; p++)
    {
        if(A[p] == 0)
        {
            A[++k]=2;
            A[++j]=1;
            A[++i]=0;
        }
        else if (A[p] == 1)
        {
            A[++k]=2;
            A[++j]=1;

        }
        else if (A[p] == 2)
        {
            A[++k]=2;
        }
    }

}