We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 90be671 + a565ba8 commit 3d6233fCopy full SHA for 3d6233f
LiiNi-coder/202510/08 PGM 연속된 부분 수열의 합.md
@@ -0,0 +1,33 @@
1
+```java
2
+import java.util.*;
3
+
4
+class Solution {
5
+ public int[] solution(int[] sequence, int k) {
6
+ int[] answer = {-1, -1};
7
+ int l = 0, r = 0, sum = 0;
8
+ Deque<Integer> q = new ArrayDeque<>();
9
+ while(r <= sequence.length){
10
+ if(sum == k){
11
+ if(answer[0] == -1 || (r - l - 1) < (answer[1] - answer[0])){
12
+ answer[0] = l;
13
+ answer[1] = r -1;
14
+ }
15
16
17
18
+ if(sum >= k){
19
+ sum -= q.poll();
20
+ l++;
21
+ }else{
22
+ if(r == sequence.length)
23
+ break;
24
+ sum += sequence[r];
25
+ q.add(sequence[r]);
26
+ r++;
27
28
29
+ return answer;
30
31
+}
32
33
+```
0 commit comments