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

    题目链接:sort-colors


    import java.util.Arrays;
    
    
    /**
     * 
    		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 SortColors {
    
    //	86 / 86 test cases passed.
    //	Status: Accepted
    //	Runtime: 194 ms
    //	Submitted: 0 minutes ago
    
    	//时间复杂度:O(n)  空间复杂度: O(1)
    	//解题思路:
    	//将数组A分为四段, A[0...i]都为0。	
    	//				A[i+1...mid-1] 都为1;
    	//				A[mid...right-1] 都为未处理的数
    	//				A[right...length) 都为2;	
    	
        static void sortColors(int[] A) {
    
        	int left = -1;
            int right = A.length;
            int mid = 0;        
            
            while(mid < right && A[mid] == 0) left = (mid++);
            
            while(mid < right && A[right - 1] == 2) right--; 
            
            while(mid < right) {        	
            	while(mid < right && A[mid] == 1) mid ++;        	
            	if(mid == right) break;        	
            	if(A[mid] == 0) exch(A, ++left, mid++);        	
            	else if(A[mid] == 2) exch(A, mid, --right);        	
            }
    //        System.out.println(Arrays.toString(A));
        }
        static void exch(int[] A, int i, int j) {
        	int temp = A[i];
        	A[i] = A[j];
        	A[j] = temp;
        }
        
    	public static void main(String[] args) {
    		sortColors(new int[]{1});
    		sortColors(new int[]{2, 0, 0});
    		sortColors(new int[]{0, 1, 2, 0, 1, 1, 2, 2, 0, 1, 2});
    
    	}
    
    }
    


  • 相关阅读:
    百度编辑器 Ueditor使用记录
    JS实现继承的几种方式
    IOS 浏览器上设置overflow: auto 不可滚动
    throw new Error('Cyclic dependency' + nodeRep)
    如何理解springaop
    SQL连接的分类
    Eclipse创建Maven-Web项目及解决 jre版本和web.xml版本问题
    SQL的几种连接:内连接、左联接、右连接、全连接、交叉连接
    Centos7下面安装eclipse
    Centos7 下编译 Openjdk8
  • 原文地址:https://www.cnblogs.com/gcczhongduan/p/5200847.html
Copyright © 2011-2022 走看看