Skip to content

Commit dc0d763

Browse files
authoredFeb 23, 2023
Create 2555-maximize-win-from-two-segments.js
1 parent 607dc5e commit dc0d763

File tree

1 file changed

+15
-0
lines changed

1 file changed

+15
-0
lines changed
 
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
/**
2+
* @param {number[]} prizePositions
3+
* @param {number} k
4+
* @return {number}
5+
*/
6+
const maximizeWin = function(prizePositions, k) {
7+
let res = 0, j = 0
8+
const n = prizePositions.length, dp = new Array(n + 1).fill(0);
9+
for (let i = 0; i < n; ++i) {
10+
while (prizePositions[j] < prizePositions[i] - k) ++j;
11+
dp[i + 1] = Math.max(dp[i], i - j + 1);
12+
res = Math.max(res, i - j + 1 + dp[j]);
13+
}
14+
return res;
15+
};

0 commit comments

Comments
 (0)
Please sign in to comment.