Maximum Number of Consecutive Values You Can Make LeetCode solution in Java

1
class Solution {
2
public int getMaximumConsecutive(int[] coins) {
3
if (coins.length == 0 && coins == null) return 0;
4
TreeMap<Integer, Integer> map = new TreeMap<Integer, Integer>();
5
for (int i : coins) map.put(i, map.getOrDefault(i, 0) + 1);
6
int range = 0;
7
for (int i : map.keySet()) {
8
if (range == 0 && i == 1) range = i * map.get(i);
9
else if (range != 0 && range + 1 >= i) range += i * map.get(i);
10
else break;
11
}
12
return range + 1;
13
}
14
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0