We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b2f1d39 commit 64d8b2bCopy full SHA for 64d8b2b
src/main/java/g2501_2600/s2537_count_the_number_of_good_subarrays/Solution.java
@@ -10,7 +10,6 @@ public long countGood(int[] nums, int k) {
10
if (nums.length < 2) {
11
return 0L;
12
}
13
-
14
Map<Integer, Integer> countMap = new HashMap<>(nums.length, 0.99f);
15
long goodSubArrays = 0L;
16
long current = 0L;
@@ -47,7 +46,6 @@ public long countGood(int[] nums, int k) {
47
46
48
49
50
51
return goodSubArrays;
52
53
0 commit comments