zoukankan      html  css  js  c++  java
  • LeetCode 75. Sort Colors 题解


    Difficulty: Medium

    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?

    public class Solution {
        public void sortColors(int[] nums) {
            //method 1 two-pass algorithm
            /**int r = 0, w = 0, b = 0;
            int length = nums.length;
            if (length == 1){
                return;
            }
            int i = 0;
            for ( i=0; i<length; i++){
                switch(nums[i]){
                    case 0:
                        r++;
                        break;
                    case 1:
                        w++;
                        break;
                    case 2:
                        b++;
                        break;
                }
                
            }
            
            for (i=0; i<r; i++){
                nums[i] = 0;
            }
                 
            for (i=0; i<w; i++){
                nums[r+i] = 1;
            }
                 
            for (i=0; i<b; i++){
                nums[r+w+i] = 2;
            }**/
            
            //method 2 one-pass algorithm
           
            int length = nums.length;
            int red = 0, blue = length - 1;
            int i=0;
            while(i < length){
                if (nums[i] == 0){
                    int tempR = nums[i];
                    nums[i] = nums[red];
                    nums[red] = tempR;
                    red++;
                    i++;
                    continue;
                } 
                
                if(nums[i] == 2 && i<blue){
                    int tempB = nums[blue];
                    nums[blue] = nums[i];
                    nums[i] = tempB;
                    blue--;
                    continue;
                }
                i++;
                
            }
            
            
        }
    
    }
    
  • 相关阅读:
    错误提示窗口-“操作系统当前的配置不能运行此应用程序”
    打印机无法打印的10种解决方法
    开发进度三
    人月神话阅读笔记二
    开发进度二
    开发进度1
    人月神话阅读笔记一
    库存物资管理系统
    四则运算
    动手动脑5
  • 原文地址:https://www.cnblogs.com/liveandlearn/p/5601462.html
Copyright © 2011-2022 走看看