码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode]Sort Colors

时间:2014-10-31 17:29:05      阅读:129      评论:0      收藏:0      [点我收藏+]

标签:java   leetcode   

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[] A) {
        int []B = new int[A.length];
        int left = 0;
        int right = B.length-1;
        for(int i = 0;i<A.length;i++){
        	if(A[i]==0){
        		B[left] = 0;
        		left++;
        	}else if(A[i]==2){
        		B[right] = 2;
        		right--;
        	}
        }
        Arrays.fill(B, left, ++right, 1);
        for(int i=0;i<A.length;i++){
        	A[i] = B[i];
        }
    }
}





[LeetCode]Sort Colors

标签:java   leetcode   

原文地址:http://blog.csdn.net/guorudi/article/details/40655525

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!