Skip to content

Commit 5a3f166

Browse files
add 2260
1 parent 422242e commit 5a3f166

File tree

2 files changed

+35
-1
lines changed

2 files changed

+35
-1
lines changed

README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------
11-
| 2259 |[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) || Easy ||
11+
| 2260 |[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2260.java) || Medium ||
12+
| 2259 |[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) || Easy ||
1213
| 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) || Medium ||
1314
| 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java) || Easy ||
1415
| 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java) || Easy ||
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,33 @@
1+
package com.fishercoder.solutions;
2+
3+
import java.util.ArrayList;
4+
import java.util.HashMap;
5+
import java.util.List;
6+
import java.util.Map;
7+
8+
public class _2260 {
9+
public static class Solution1 {
10+
public int minimumCardPickup(int[] cards) {
11+
int min = cards.length;
12+
Map<Integer, List<Integer>> map = new HashMap<>();
13+
for (int i = 0; i < cards.length; i++) {
14+
List<Integer> list = map.getOrDefault(cards[i], new ArrayList<>());
15+
list.add(i);
16+
map.put(cards[i], list);
17+
}
18+
boolean found = false;
19+
for (int key : map.keySet()) {
20+
List<Integer> list = map.get(key);
21+
for (int i = 0; i < list.size() - 1; i++) {
22+
found = true;
23+
min = Math.min(min, list.get(i + 1) - list.get(i) + 1);
24+
}
25+
}
26+
if (!found) {
27+
return -1;
28+
} else {
29+
return min;
30+
}
31+
}
32+
}
33+
}

0 commit comments

Comments
 (0)