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

Appearance settings

Latest commit

 

History

History
History
29 lines (25 loc) · 843 Bytes

File metadata and controls

29 lines (25 loc) · 843 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
import java.util.*;
class Main {
public static int n = 5; // 데이터의 개수 N
public static int m = 5; // 찾고자 하는 부분합 M
public static int[] arr = {1, 2, 3, 2, 5}; // 전체 수열
public static void main(String[] args) {
int cnt = 0;
int intervalSum = 0;
int end = 0;
// start를 차례대로 증가시키며 반복
for (int start = 0; start < n; start++) {
// end를 가능한 만큼 이동시키기
while (intervalSum < m && end < n) {
intervalSum += arr[end];
end += 1;
}
// 부분합이 m일 때 카운트 증가
if (intervalSum == m) {
cnt += 1;
}
intervalSum -= arr[start];
}
System.out.println(cnt);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.