Repository navigation
Expand file tree
/
Copy pathSolution5.java
More file actions
135 lines (108 loc) · 3.44 KB
/
Copy pathSolution5.java
File metadata and controls
135 lines (108 loc) · 3.44 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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
public class Solution5 extends Solution {
public Solution5() {
super(5);
}
public static void main(String[] args) {
Solution solution = new Solution5();
solution.testPartTwo();
}
@Override
String solvePartOne(String inputData) {
String[] lines = inputData.split("\n");
List<long[]> ranges = new ArrayList<>();
int i = 0;
// Read only the first section (ranges)
for (; i < lines.length; i++) {
String line = lines[i].trim();
if (line.isEmpty()) {
i++;
break;
}
String[] parts = line.split("-");
long a = Long.parseLong(parts[0]);
long b = Long.parseLong(parts[1]);
ranges.add(new long[]{a, b});
}
// Sort by start
ranges.sort(Comparator.comparingLong(r -> r[0]));
// Merge intervals
List<long[]> merged = new ArrayList<>();
for (long[] r : ranges) {
if (merged.isEmpty()) {
merged.add(r);
continue;
}
long[] last = merged.get(merged.size() - 1);
if (r[0] <= last[1] + 1) {
last[1] = Math.max(last[1], r[1]);
} else {
merged.add(r);
}
}
long count = 0;
for (; i < lines.length; i++) {
String line = lines[i].trim();
if (line.isEmpty()) continue;
long id = Long.parseLong(line);
if (isInRanges(id, merged)) {
count++;
}
}
return String.valueOf(count);
}
private boolean isInRanges(long id, List<long[]> merged) {
int left = 0, right = merged.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
long[] r = merged.get(mid);
if (id < r[0]) {
right = mid - 1;
} else if (id > r[1]) {
left = mid + 1;
} else {
return true;
}
}
return false;
}
@Override
String solvePartTwo(String inputData) {
String[] lines = inputData.split("\n");
List<long[]> ranges = new ArrayList<>();
int i = 0;
// Read only the first section (ranges)
for (; i < lines.length; i++) {
String line = lines[i].trim();
if (line.isEmpty()) break;
String[] parts = line.split("-");
long a = Long.parseLong(parts[0]);
long b = Long.parseLong(parts[1]);
ranges.add(new long[]{a, b});
}
// Sort by start
ranges.sort(Comparator.comparingLong(r -> r[0]));
// Merge intervals
List<long[]> merged = new ArrayList<>();
for (long[] r : ranges) {
if (merged.isEmpty()) {
merged.add(new long[]{r[0], r[1]});
continue;
}
long[] last = merged.get(merged.size() - 1);
if (r[0] <= last[1] + 1) {
last[1] = Math.max(last[1], r[1]);
} else {
merged.add(new long[]{r[0], r[1]});
}
}
// Count total IDs across merged ranges
long count = 0;
for (long[] r : merged) {
count += (r[1] - r[0] + 1);
}
return String.valueOf(count);
}
}