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?

    public class Solution {
        /**This is a fundamental problem.<br>
         * Since we know the possible numbers in the array and know where we should put them,
         * we can sort them in O(n) time.
         * 
         * @param A --Integer array, the array contains 0's , 1's , 2's.
         * @author Averill Zheng
         * @version 2014-06-05
         * @since JDk 1.7
         */
        public void sortColors(int[] A) {
            int length = A.length, tail = length, head = 0;
    		
    		for(int i = 0; i < tail; ++i){
    			if(A[i] == 0){
    				int temp = A[head];
    				A[head] = A[i];
    				++head;
    				A[i] = temp;
    			}
    			else if(A[i] == 2){
    				int temp = A[tail - 1];
    				A[tail - 1] = A[i];
    				A[i] = temp;
    				--tail;
    				--i;
    			}
    		}    
        }
    }
    

      

  • 相关阅读:
    汉字在屏幕上的显示
    手机上的ROM与RAM
    数据表示和计算
    存储器的层次结构
    计算机系统概述
    Python中的文件路径的分隔符
    网络爬虫的基本原理
    iOS多线程简介
    Quartz2D简介
    iOS 事件传递响应链
  • 原文地址:https://www.cnblogs.com/averillzheng/p/3773881.html
Copyright © 2011-2022 走看看