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

    A more clearer solution:

     1 public class Solution {
     2     public void sortColors(int[] A) {
     3         if (A.length<2) return;
     4         
     5         int p0=0,p2=A.length-1;
     6         while (p0<A.length && A[p0]==0) p0++;
     7         while (p2>=0 && A[p2]==2) p2--;
     8         int cur = p0;
     9         while (cur<=p2){
    10             if (A[cur]==1)
    11                 cur++;
    12             else if (A[cur]==0){
    13                 swap(A,p0,cur);
    14                 while (p0<A.length && A[p0]==0) p0++;
    15             } else {
    16                 swap(A,p2,cur);
    17                 while (p2>=0 && A[p2]==2) p2--;
    18             }
    19             
    20             if (cur<p0) cur=p0;
    21         }
    22         
    23         return;
    24     }
    25     
    26     public void swap(int[] A, int x, int y){
    27         int temp = A[x];
    28         A[x] = A[y];
    29         A[y] = temp;
    30     }
    31 }

    One-pass solution:

     1 public class Solution {
     2     public void sortColors(int[] A) {
     3         if (A.length==0 || A.length==1) return;
     4         
     5         int index=0;
     6         int rIndex = 0, bIndex=A.length-1;
     7         while (index<=bIndex){
     8             if (A[index]==0 && index==rIndex){
     9                 index++;
    10                 rIndex++;
    11             } else if (A[index]==0){
    12                 swap(A,index,rIndex);
    13                 rIndex++;
    14             } else if (A[index]==1) index++;
    15             else {
    16                 swap(A,index,bIndex);
    17                 bIndex--;
    18             }
    19 
    20          }
    21              
    22 
    23         
    24     }
    25 
    26     public void swap(int[] A, int i, int j){
    27         int temp = A[i];
    28         A[i]=A[j];
    29         A[j]=temp;
    30     }
    31 }
  • 相关阅读:
    cmd 新建空文件
    查看Linux版本
    centos7时间调整
    正确卸载vs2015及以前版本方式
    vs2017,vs2019 无法连接到Web服务器“IIS Express”
    .netcore开发环境和服务器注意事项
    .netcore 网站启动后 502.5
    CentOS7开机报错piix4_smbus ****host smbus controller not enabled
    centos7 升级系统后,启动界面出现多个选项
    .gitkeep文件
  • 原文地址:https://www.cnblogs.com/lishiblog/p/4125507.html
Copyright © 2011-2022 走看看