Movatterモバイル変換


[0]ホーム

URL:


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

Commit42b4851

Browse files
authored
Create Constrained Subsequence Sum.java
1 parentb99d324 commit42b4851

File tree

1 file changed

+16
-0
lines changed

1 file changed

+16
-0
lines changed

‎Hard/Constrained Subsequence Sum.java

Lines changed: 16 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
classSolution {
2+
publicintconstrainedSubsetSum(int[]nums,intk) {
3+
PriorityQueue<int[]>pq =newPriorityQueue<>((a,b) ->b[0] -a[0]);
4+
pq.add(newint[]{nums[0],0});
5+
intresult =nums[0];
6+
for (inti =1;i <nums.length;i++) {
7+
while (i -pq.peek()[1] >k) {
8+
pq.remove();
9+
}
10+
intcurr =Math.max(0,pq.peek()[0]) +nums[i];
11+
result =Math.max(result,curr);
12+
pq.add(newint[]{curr,i});
13+
}
14+
returnresult;
15+
}
16+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp