Skip to content

Commit d845317

Browse files
committed
Improved format
1 parent 0e35472 commit d845317

File tree

1 file changed

+0
-5
lines changed
  • src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i

1 file changed

+0
-5
lines changed

src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i/Solution.java

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -8,25 +8,20 @@
88
import java.util.Map;
99

1010
public class Solution {
11-
1211
private static final int MOD = 1000000007;
1312

1413
public int subsequencesWithMiddleMode(int[] a) {
1514
int n = a.length;
16-
1715
// Create a dictionary to store indices of each number
1816
Map<Integer, List<Integer>> dict = new HashMap<>();
1917
for (int i = 0; i < n; i++) {
2018
dict.computeIfAbsent(a[i], k -> new ArrayList<>()).add(i);
2119
}
22-
2320
long ans = 0L;
24-
2521
// Iterate over each unique number and its indices
2622
for (Map.Entry<Integer, List<Integer>> entry : dict.entrySet()) {
2723
List<Integer> b = entry.getValue();
2824
int m = b.size();
29-
3025
for (int k = 0; k < m; k++) {
3126
int i = b.get(k);
3227
int r = m - 1 - k;

0 commit comments

Comments
 (0)