zoukankan      html  css  js  c++  java
  • [Leetcode 97] 75 Sort Colors

    Problem:

    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?

    Analysis:

    This problem can be solved via scanning and counting. After the first scan, we can know the number of each colored objects, then we just need to put corresponding number of colored objects into the array. The complexity is O(2n).

    But the follow up requires O(n) time complexity and constant space algorithm. So we can use in-place swapping to solve the problem. Use idx i points to the 0's next to place position and idx j points to 2's next to place position. Then scan from 0 to j. 

    If A[cur] == 0, swap A[cur] and A[i]. And increase i and cur;

    If A[cur] == 2, swap A[cur] and A[j]. And decrease j;

    If A[cur] == 1, do nothing. And increase cur.

    Only one-pass is needed in this method.

    Code:

    Two-pass counting method

     1 class Solution {
     2 public:
     3     void sortColors(int A[], int n) {
     4         // Start typing your C/C++ solution below
     5         // DO NOT write int main() function
     6         int r = 0, w = 0, b = 0;
     7         
     8         for (int i=0; i<n; i++) {
     9             if (A[i] == 0)
    10                 r++;
    11             else if (A[i] == 1)
    12                 w++;
    13             else
    14                 b++;
    15         }
    16         
    17         for (int i=0; i<n; i++) {
    18             if (i<r)
    19                 A[i] = 0;
    20             else if (i>=r && i<r+w)
    21                 A[i] = 1;
    22             else
    23                 A[i] = 2;
    24         }
    25         
    26     }
    27 };
    View Code

    One-pass swap method

     1 class Solution {
     2 public:
     3     void sortColors(int A[], int n) {
     4         // Start typing your C/C++ solution below
     5         // DO NOT write int main() function
     6         int low = 0, high = n-1;
     7         
     8         for (int i=0; i<=high; ) {
     9             if (A[i] == 0) {
    10                 swap(A[i], A[low]);
    11                 low++;
    12                 i++;
    13             }
    14             else if (A[i] == 2) {
    15                 swap(A[i], A[high]);
    16                 high--;
    17             }
    18             else {
    19                 i++;
    20             }
    21         }
    22         
    23     }
    24     
    25     void swap(int &a, int &b) {
    26         int tmp = a;
    27         a = b;
    28         b = tmp;
    29     }
    30 };
    View Code
  • 相关阅读:
    Linux服务器在SSH客户端如何实现免密登录
    在linux服务器下JMeter如何执行jmx性能脚本
    单元测试
    JsonPath如何获取JSON数据中的值
    TestNG Suite 运行出现中文乱码如何解决
    Java如何获取JSON数据中的值
    数组的冒泡排序
    java数组扩容
    null类型不能转换成double基本类
    Java 将目录下的文件移动到指定的目录文件下
  • 原文地址:https://www.cnblogs.com/freeneng/p/3240487.html
Copyright © 2011-2022 走看看