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.
You are not suppose to use the library‘s sort function for this problem.
You should do it in-place (sort numbers in the original array).
Given [1, 0, 1, 2], sort it in-place to [0, 1, 1, 2].
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?
class Solution { /** * @param nums: A list of integer which is 0, 1 or 2 * @return: nothing */ public void sortColors(int[] nums) { // write your code here if(nums == null || nums.length == 0) return; int left = 0; int right = nums.length - 1; while(left < right && nums[left] == 0) left++; while(left < right && nums[right] == 2) right--; int i = left; while(i < right){ if(nums[i] == 0){ swap(nums, i, left); while(left < right && nums[left] == 0) left++; i = left; } else if(nums[i] == 1){ i++; } else{ swap(nums, i, right); while(left < right && nums[right] == 2) right--; } } if(nums[right] == 0) swap(nums, left, right); return; } public void swap(int[] nums, int i, int j){ int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; return; } }
原文：http://www.cnblogs.com/goblinengineer/p/5357679.html