Skip to content

Commit c5b3433

Browse files
authored
feat: add solutions to lc problem: No.0495 (doocs#929)
1 parent 23bc2d9 commit c5b3433

File tree

3 files changed

+34
-0
lines changed

3 files changed

+34
-0
lines changed

solution/0400-0499/0495.Teemo Attacking/README.md

+13
Original file line numberDiff line numberDiff line change
@@ -142,6 +142,19 @@ public class Solution {
142142
}
143143
```
144144

145+
### **TypeScript**
146+
147+
```ts
148+
function findPoisonedDuration(timeSeries: number[], duration: number): number {
149+
const n = timeSeries.length;
150+
let ans = duration;
151+
for (let i = 1; i < n; ++i) {
152+
ans += Math.min(duration, timeSeries[i] - timeSeries[i - 1]);
153+
}
154+
return ans;
155+
}
156+
```
157+
145158
### **...**
146159

147160
```

solution/0400-0499/0495.Teemo Attacking/README_EN.md

+13
Original file line numberDiff line numberDiff line change
@@ -121,6 +121,19 @@ public class Solution {
121121
}
122122
```
123123

124+
### **TypeScript**
125+
126+
```ts
127+
function findPoisonedDuration(timeSeries: number[], duration: number): number {
128+
const n = timeSeries.length;
129+
let ans = duration;
130+
for (let i = 1; i < n; ++i) {
131+
ans += Math.min(duration, timeSeries[i] - timeSeries[i - 1]);
132+
}
133+
return ans;
134+
}
135+
```
136+
124137
### **...**
125138

126139
```
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
function findPoisonedDuration(timeSeries: number[], duration: number): number {
2+
const n = timeSeries.length;
3+
let ans = duration;
4+
for (let i = 1; i < n; ++i) {
5+
ans += Math.min(duration, timeSeries[i] - timeSeries[i - 1]);
6+
}
7+
return ans;
8+
}

0 commit comments

Comments
 (0)