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
15 lines (14 loc) · 469 Bytes

File metadata and controls

15 lines (14 loc) · 469 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
package ch23;
public class P92_3 {
public int maxSubArray(int[] nums) {
int currentSum = 0;
int bestSum = Integer.MIN_VALUE;
for (int num : nums) {
// 현재 값과 (누적된 값 + 현재 값) 중 더 큰 값을 저장
currentSum = Math.max(num, currentSum + num);
// 매번 최댓값을 계산하여 저장
bestSum = Math.max(bestSum, currentSum);
}
return bestSum;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.