Skip to content

Commit f482656

Browse files
committed
Improved 3480
1 parent cbd08cd commit f482656

File tree

2 files changed

+8
-3
lines changed
  • src
    • main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair
    • test/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair

2 files changed

+8
-3
lines changed

src/main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.java

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -48,9 +48,7 @@ public long maxSubarrays(int n, int[][] conflictingPairs) {
4848
// (If there is no candidate pair at j, h[j] remains n+1.)
4949
for (int j = 1; j <= n; j++) {
5050
// no conflicting pair at index j
51-
// Only if removal would change h[j] (i.e. h[j] < d2[j])
52-
// no alternative candidate exists
53-
if (h[j] == n + 1 || d2[j] == h[j]) {
51+
if (h[j] == n + 1) {
5452
continue;
5553
}
5654
// Simulate removal: new candidate at j becomes d2[j]

src/test/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/SolutionTest.java

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -21,4 +21,11 @@ void maxSubarrays2() {
2121
void maxSubarrays3() {
2222
assertThat(new Solution().maxSubarrays(10, new int[][] {{10, 5}, {3, 8}}), equalTo(50L));
2323
}
24+
25+
@Test
26+
void maxSubarrays4() {
27+
assertThat(
28+
new Solution().maxSubarrays(25, new int[][] {{9, 7}, {15, 7}, {4, 7}}),
29+
equalTo(216L));
30+
}
2431
}

0 commit comments

Comments
 (0)