-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathLeetCode75.java
More file actions
65 lines (62 loc) · 1.57 KB
/
LeetCode75.java
File metadata and controls
65 lines (62 loc) · 1.57 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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
package problems;
public class LeetCode75 {
public void sortColors(int[] nums) {
int n = nums.length;
int newNums[] =new int[n];
int red = 0;
int blue = n-1;
for(int i=0;i<n;i++){
if(nums[i]==0){
newNums[red++]=0;
}
if(nums[i]==2){
newNums[blue--]=2;
}
}
for(int i=red;i<blue;i++){
newNums[i]=1;
}
for(int i=0;i<n;i++){
nums[i]=newNums[i];
}
}
public void sortColors1(int[] nums) {
int n = nums.length;
int p0 = 0,p2 = n-1;
for(int i=0; i <= p2; ++i){
while(i <= p2 && nums[i] == 2){
int temp = nums[i];
nums[i] = nums[p2];
nums[p2] = temp;
--p2;
}
if(nums[i] ==0){
int temp = nums[i];
nums[i] = nums[p0];
nums[p0] = temp;
++p0;
}
}
}
}
class LeetCode75_1 {
public void sortColors(int[] nums) {
int n = nums.length;
int red = 0;
int blue = n - 1;
for (int i = 0; i < n; i++) {
while (i < blue && nums[i] == 2) {
int temp = nums[i];
nums[i] = nums[blue];
nums[blue] = temp;
blue--;
}
if(nums[i] == 0) {
int temp = nums[i];
nums[i] = nums[red];
nums[red] = temp;
red++;
}
}
}
}