75. Sort Colors
Given an array with n objects colored red, white or blue, sort them in-place 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.
Example:
Input: [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]
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 a one-pass algorithm using only constant space?
解法一:
class Solution {
public void sortColors(int[] nums) {
int[] a = new int[3];
for(int i=0;i<nums.length;i++)++a[nums[i]];
for(int i=0;i<nums.length;i++){
if(i>=0 && i<a[0])nums[i] = 0;
if(i>=a[0] && i<a[1]+a[0])nums[i] = 1;
if(i>=a[1]+a[0] && i<a[0]+a[1]+a[2])nums[i] = 2;
}
}
}
解法二:
建立左右指针记录0和2的位置,从左到右扫描数组,遇到0,交换位置,left++;遇到2,交换位置,right--。
记得迭代的终止条件是右边的指针要比循环的指针大,因为超过去了之后实际上已经完成了排序。
还需要注意一点的是,右边的数据需要不断的换位,只到换回来的数字不是2才行,所以需要i--。
class Solution {
public void sortColors(int[] nums) {
int len = nums.length;
int left = 0;
int right = len-1;
for(int i=0;i<=right;i++){
if(nums[i] == 0){
swap(nums,left,i);
//i--;
left++;
}else if(nums[i] == 2){
swap(nums,right,i);
i--;
right--;
}
}
}
public void swap(int[]nums, int a,int b){
int tmp = nums[a];
nums[a] = nums[b];
nums[b] = tmp;
}
}