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

    思路:该题很简单,直接把快排实现以下,代码如下:

     1 class Solution {
     2 public:
     3     void sortColors(int A[], int n) {
     4         if(n==1)  return;
     5         quick_sort(A,0,n-1);
     6     }
     7     
     8     void quick_sort(int A[],int l,int r)
     9     {
    10         if(l>=r)  return;
    11         else
    12         {
    13            int mid=fen(A,l,r);
    14            quick_sort(A,l,mid-1);
    15            quick_sort(A,mid+1,r);
    16         }
    17     }
    18     
    19     int fen(int A[],int  l,int r)
    20     {
    21         int k=A[l];
    22         int i=l;
    23         int j=r;
    24         while(i<j)
    25         {
    26             while(A[i]<=k&&i<j){i++;}
    27             while(A[j]>=k&&i<j){j--;}
    28            
    29             swap(A[i],A[j]);
    30         }
    31         if(A[l]>A[i])
    32         {
    33           swap(A[l],A[i]);
    34           return i;
    35         }
    36         else
    37         {
    38         swap(A[l],A[i-1]);
    39            return i-1;
    40         }
    41     }
    42 };
  • 相关阅读:
    代理支持
    CGI
    SSI(服务器端嵌入)
    SSL/TLS 配置
    JSPs
    类加载机制
    JDBC 数据源
    安全管理
    Realm 配置
    Js将序列化成Json格式后日期(毫秒数)转成日期格式
  • 原文地址:https://www.cnblogs.com/sqxw/p/3953894.html
Copyright © 2011-2022 走看看