Class Solution
-
- All Implemented Interfaces:
public final class Solution
3386 - Button with Longest Push Time.
Easy
You are given a 2D array
events
which represents a sequence of events where a child pushes a series of buttons on a keyboard.Each <code>eventsi = index<sub>i</sub>, time<sub>i</sub></code> indicates that the button at index <code>index<sub>i</sub></code> was pressed at time <code>time<sub>i</sub></code>.
The array is sorted in increasing order of
time
.The time taken to press a button is the difference in time between consecutive button presses. The time for the first button is simply the time at which it was pressed.
Return the
index
of the button that took the longest time to push. If multiple buttons have the same longest time, return the button with the smallestindex
.Example 1:
Input: events = [1,2,2,5,3,9,1,15]
Output: 1
Explanation:
Button with index 1 is pressed at time 2.
Button with index 2 is pressed at time 5, so it took
5 - 2 = 3
units of time.Button with index 3 is pressed at time 9, so it took
9 - 5 = 4
units of time.Button with index 1 is pressed again at time 15, so it took
15 - 9 = 6
units of time.
Example 2:
Input: events = [10,5,1,7]
Output: 10
Explanation:
Button with index 10 is pressed at time 5.
Button with index 1 is pressed at time 7, so it took
7 - 5 = 2
units of time.
Constraints:
1 <= events.length <= 1000
<code>eventsi == index<sub>i</sub>, time<sub>i</sub></code>
<code>1 <= index<sub>i</sub>, time<sub>i</sub><= 10<sup>5</sup></code>
The input is generated such that
events
is sorted in increasing order of <code>time<sub>i</sub></code>.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Integer
buttonWithLongestTime(Array<IntArray> events)
-
-
Method Detail
-
buttonWithLongestTime
final Integer buttonWithLongestTime(Array<IntArray> events)
-
-
-
-