We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2759961 commit b0c9712Copy full SHA for b0c9712
src/main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair/Solution.java
@@ -5,9 +5,9 @@
5
6
import java.util.Arrays;
7
8
+@SuppressWarnings("java:S135")
9
public class Solution {
10
public long maxSubarrays(int n, int[][] conflictingPairs) {
- int[][] thornibrax = conflictingPairs;
11
long totalSubarrays = (long) n * (n + 1) / 2;
12
int[] h = new int[n + 1];
13
int[] d2 = new int[n + 1];
0 commit comments