-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2432-TheEmployeeThatWorkedOnTheLongestTask.go
More file actions
96 lines (85 loc) · 3.98 KB
/
2432-TheEmployeeThatWorkedOnTheLongestTask.go
File metadata and controls
96 lines (85 loc) · 3.98 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
package main
// 2432. The Employee That Worked on the Longest Task
// There are n employees, each with a unique id from 0 to n - 1.
// You are given a 2D integer array logs where logs[i] = [idi, leaveTimei] where:
// idi is the id of the employee that worked on the ith task, and
// leaveTimei is the time at which the employee finished the ith task. All the values leaveTimei are unique.
// Note that the ith task starts the moment right after the (i - 1)th task ends, and the 0th task starts at time 0.
// Return the id of the employee that worked the task with the longest time.
// If there is a tie between two or more employees, return the smallest id among them.
// Example 1:
// Input: n = 10, logs = [[0,3],[2,5],[0,9],[1,15]]
// Output: 1
// Explanation:
// Task 0 started at 0 and ended at 3 with 3 units of times.
// Task 1 started at 3 and ended at 5 with 2 units of times.
// Task 2 started at 5 and ended at 9 with 4 units of times.
// Task 3 started at 9 and ended at 15 with 6 units of times.
// The task with the longest time is task 3 and the employee with id 1 is the one that worked on it, so we return 1.
// Example 2:
// Input: n = 26, logs = [[1,1],[3,7],[2,12],[7,17]]
// Output: 3
// Explanation:
// Task 0 started at 0 and ended at 1 with 1 unit of times.
// Task 1 started at 1 and ended at 7 with 6 units of times.
// Task 2 started at 7 and ended at 12 with 5 units of times.
// Task 3 started at 12 and ended at 17 with 5 units of times.
// The tasks with the longest time is task 1. The employee that worked on it is 3, so we return 3.
// Example 3:
// Input: n = 2, logs = [[0,10],[1,20]]
// Output: 0
// Explanation:
// Task 0 started at 0 and ended at 10 with 10 units of times.
// Task 1 started at 10 and ended at 20 with 10 units of times.
// The tasks with the longest time are tasks 0 and 1. The employees that worked on them are 0 and 1, so we return the smallest id 0.
// Constraints:
// 2 <= n <= 500
// 1 <= logs.length <= 500
// logs[i].length == 2
// 0 <= idi <= n - 1
// 1 <= leaveTimei <= 500
// idi != idi+1
// leaveTimei are sorted in a strictly increasing order.
import "fmt"
func hardestWorker(n int, logs [][]int) int {
id, mx := logs[0][0], logs[0][1]
for i := 1; i < len(logs); i++ {
v := logs[i][1] - logs[i - 1][1]
if v > mx {
mx, id = v, logs[i][0]
} else if v == mx && logs[i][0] < id {
id = logs[i][0]
}
}
return id
}
func main() {
// Example 1:
// Input: n = 10, logs = [[0,3],[2,5],[0,9],[1,15]]
// Output: 1
// Explanation:
// Task 0 started at 0 and ended at 3 with 3 units of times.
// Task 1 started at 3 and ended at 5 with 2 units of times.
// Task 2 started at 5 and ended at 9 with 4 units of times.
// Task 3 started at 9 and ended at 15 with 6 units of times.
// The task with the longest time is task 3 and the employee with id 1 is the one that worked on it, so we return 1.
fmt.Println(hardestWorker(10, [][]int{{0,3},{2,5},{0,9},{1,15}})) // 1
// Example 2:
// Input: n = 26, logs = [[1,1],[3,7],[2,12],[7,17]]
// Output: 3
// Explanation:
// Task 0 started at 0 and ended at 1 with 1 unit of times.
// Task 1 started at 1 and ended at 7 with 6 units of times.
// Task 2 started at 7 and ended at 12 with 5 units of times.
// Task 3 started at 12 and ended at 17 with 5 units of times.
// The tasks with the longest time is task 1. The employee that worked on it is 3, so we return 3.
fmt.Println(hardestWorker(26, [][]int{{1,1},{3,7},{2,12},{7,17}})) // 3
// Example 3:
// Input: n = 2, logs = [[0,10],[1,20]]
// Output: 0
// Explanation:
// Task 0 started at 0 and ended at 10 with 10 units of times.
// Task 1 started at 10 and ended at 20 with 10 units of times.
// The tasks with the longest time are tasks 0 and 1. The employees that worked on them are 0 and 1, so we return the smallest id 0.
fmt.Println(hardestWorker(2, [][]int{{0,10},{1,20}})) // 0
}