Repository navigation
Expand file tree
/
Copy path_75.java
More file actions
42 lines (33 loc) · 1.37 KB
/
Copy path_75.java
File metadata and controls
42 lines (33 loc) · 1.37 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
package com.fishercoder.solutions;
/** 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.
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 _75 {
public void sortColors(int[] nums) {
int zero = 0, two = nums.length-1;
for(int i = 0; i <= two;){
if(nums[i] == 0 && i > zero) swap(nums, i, zero++);
else if(nums[i] == 2 && i < two) swap(nums, i, two--);
else i++;
}
}
void swap(int[] nums, int m, int n){
int temp = nums[m];
nums[m] = nums[n];
nums[n] = temp;
}
public static void main(String...args){
// int[] nums = new int[]{0,1,2,0,2,1};
// int[] nums = new int[]{0};
// int[] nums = new int[]{2};
int[] nums = new int[]{2,2,1};
// int[] nums = new int[]{1,0};
}
}