zoukankan      html  css  js  c++  java
  • 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?

    class Solution {
    public:
        void sortColors(int A[], int n) {
            if(n==0)
                return;
                
            int count0=0;
            int count1=0;
            int count2=0;
            for(int i=0;i<n;i++)
                if(A[i]==0)
                    count0++;
            for(int i=0;i<n;i++)
                if(A[i]==1)
                    count1++;
            for(int i=0;i<n;i++)
                if(A[i]==2)
                    count2++;
            for(int i=0;i<count0;i++)
                A[i]=0;
            for(int i=0;i<count1;i++)
                A[i+count0]=1;
            for(int i=0;i<count2;i++)
                A[i+count0+count1]=2;
        }
    }; 
  • 相关阅读:
    朴素贝叶斯
    用极大似然解释最小二乘法
    1(2).生成模型和判别模型
    1(1).有监督 VS 无监督
    python 进程与线程
    ASP.NET MVC 项目直接预览PDF文件
    有关层的垂直居中
    js的正则表达式编程,悬赏解决下面的问题
    jQuery-contextMenu使用教程
    【自己开发】Jquery的loading插件
  • 原文地址:https://www.cnblogs.com/erictanghu/p/3759495.html
Copyright © 2011-2022 走看看