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 e956631 commit 058e3beCopy full SHA for 058e3be
src/main/java/g2801_2900/s2808_minimum_seconds_to_equalize_a_circular_array/Solution.java
@@ -15,7 +15,6 @@ public int minimumSeconds(List<Integer> nums) {
15
int v = nums.get(i);
16
hm.computeIfAbsent(v, k -> new ArrayList<>()).add(i);
17
}
18
-
19
for (List<Integer> list : hm.values()) {
20
if (list.size() > 1) {
21
int curr = (list.get(0) + n - list.get(list.size() - 1)) / 2;
0 commit comments