Problem Description
You are given a 2D integer array logs where logs[i] = [id_i, leaveTime_i] representing the employee id and the time they finished their task. The task starts right after the previous task ends, with the first task starting at time 0. Your goal is to determine which employee worked on the task with the longest duration. In case of a tie, return the smallest employee id.
Key Insights
- Each task's duration can be calculated as the difference between the current leaveTime and the previous task's leaveTime.
- The first task starts at time 0, so its duration is simply its leaveTime.
- We need to keep track of the maximum duration found and the corresponding employee id.
- If multiple employees have the same maximum duration, return the employee with the smallest id.
Space and Time Complexity
Time Complexity: O(m), where m is the number of tasks (length of logs).
Space Complexity: O(1), as we are using a constant amount of extra space.
Solution
To solve the problem, we can iterate through the logs array and calculate the duration of each task. We maintain a variable to track the maximum duration and another to track the corresponding employee id. If a new maximum is found, we update both variables. If a tie is encountered, we update the employee id only if it is smaller than the current id.