Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 24fe920

Browse files
feat: add typescript solution to lc problem: No.2432
No.2432.The Employee That Worked on the Longest Task
1 parent 21e293a commit 24fe920

File tree

3 files changed

+36
-2
lines changed

3 files changed

+36
-2
lines changed

‎solution/2400-2499/2432.The Employee That Worked on the Longest Task/README.md‎

Lines changed: 12 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -172,7 +172,18 @@ func hardestWorker(n int, logs [][]int) int {
172172
### **TypeScript**
173173

174174
```ts
175-
175+
function hardestWorker(n: number, logs: number[][]): number {
176+
let [ans, max_num] = logs[0];
177+
for (let i = 1; i < logs.length; i++) {
178+
let duration = logs[i][1] - logs[i - 1][1];
179+
let id = logs[i][0];
180+
if (duration > max_num || (duration == max_num && id < ans)) {
181+
ans = id;
182+
max_num = duration;
183+
}
184+
}
185+
return ans;
186+
};
176187
```
177188

178189
### **...**

‎solution/2400-2499/2432.The Employee That Worked on the Longest Task/README_EN.md‎

Lines changed: 12 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -156,7 +156,18 @@ func hardestWorker(n int, logs [][]int) int {
156156
### **TypeScript**
157157

158158
```ts
159-
159+
function hardestWorker(n: number, logs: number[][]): number {
160+
let [ans, max_num] = logs[0];
161+
for (let i = 1; i < logs.length; i++) {
162+
let duration = logs[i][1] - logs[i - 1][1];
163+
let id = logs[i][0];
164+
if (duration > max_num || (duration == max_num && id < ans)) {
165+
ans = id;
166+
max_num = duration;
167+
}
168+
}
169+
return ans;
170+
};
160171
```
161172

162173
### **...**
Lines changed: 12 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,12 @@
1+
function hardestWorker(n: number, logs: number[][]): number {
2+
let [ans, max_num] = logs[0];
3+
for (let i = 1; i < logs.length; i++) {
4+
let duration = logs[i][1] - logs[i - 1][1];
5+
let id = logs[i][0];
6+
if (duration > max_num || (duration == max_num && id < ans)) {
7+
ans = id;
8+
max_num = duration;
9+
}
10+
}
11+
return ans;
12+
};

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /