_3386.java

packagecom.fishercoder.solutions.fourththousand;

importjava.util.HashMap;
importjava.util.Map;

publicclass_3386 {
publicstaticclassSolution1 {
publicintbuttonWithLongestTime(int[][] events) {
Map<Integer, Integer> map = newHashMap<>();
intans = events[0][0];
map.put(events[0][0], events[0][1]);
for (inti = 1; i < events.length; i++) {
intduration = events[i][1] - events[i - 1][1];
if (map.getOrDefault(events[i][0], 0) < duration) {
map.put(events[i][0], duration);
 }
 }
intmaxDuration = events[0][1];
for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
if (entry.getValue() > maxDuration) {
ans = entry.getKey();
maxDuration = entry.getValue();
 } elseif (entry.getValue() == maxDuration) {
if (entry.getKey() < ans) {
ans = entry.getKey();
 }
 }
 }
returnans;
 }
 }
}