-
-
Notifications
You must be signed in to change notification settings - Fork 338
Expand file tree
/
Copy pathjinvicky.java
More file actions
43 lines (37 loc) ยท 1.42 KB
/
jinvicky.java
File metadata and controls
43 lines (37 loc) ยท 1.42 KB
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
// [์ฐธ๊ณ ]
// ์นด๋ฐ์ธ ์๊ณ ๋ฆฌ์ฆ: ์ด์ ์์์ ๋ถ๋ถํฉ์ ์๋ฉด ํ์ฌ์์์ ์ต๋๊ฐ์ ์ ์ ์๋ค.
// ์์๋ง์ด๋ผ๋ฉด ๋จ์ํ dp๋ก dp[nums.length-1] ๊ฐ์ด๋ total์ด๋ผ๋ ๊ณ์ฐ๊ฐ์ ๋ฆฌํดํ๊ฒ ์ง๋ง,
// ์์๊ฐ ํฌํจ๋์์ผ๋ฏ๋ก bestSum๊ณผ currentSum์ ๋ณ๊ฐ์ ๋ณ์๋ก ์ฒ๋ฆฌํ๋ค.
// currentSum์ ์ต๋ sum์ ๊ตฌํด์ผ ํ๋ฏ๋ก ์์๊ฐ์ผ๋ ๊ฐ์ ๋ก 0์ผ๋ก ์
๋ฐ์ดํธ ํ ๊ณ์ฐ์ ์คํํ๋ค.
// https://velog.io/@wind1992/Leetcode-53.-Maximum-Subarray
//
// [ํ์ด๋ฐฉ์]
// 1. ์นด๋ฐ์ธ ์๊ณ ๋ฆฌ์ฆ 2. DP
// [์ฑ๋ฅ]
// dp ๋ฐฐ์ด๋ณด๋ค ๋ณ์๋ฅผ ์ฌ์ฉํ๋ ๊ฒ์ด ๊ณต๊ฐ ๋ณต์ก๋๋ฅผ ์ค์ผ ์ ์๋ค. ๋ํ for๋ฌธ 1๊ฐ๋ก ํด๊ฒฐ ๊ฐ๋ฅํ๋ค.
class Solution {
public int maxSubArray(int[] nums) {
int bestSum = nums[0];
int currentSum = 0;
for (int n : nums) {
if (currentSum < 0) { // 1. ์
๋ฐ์ดํธ
currentSum = 0;
}
// 2. ๊ณ์ฐ
currentSum += n;
bestSum = Math.max(currentSum, bestSum);
}
return bestSum;
}
public int maxSubArrayDp(int[] nums) {
int n = nums.length;
int[] dp = new int[n];
dp[0] = nums[0];
int maxSum = dp[0];
for (int i = 1; i < n; i++) {
dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
maxSum = Math.max(maxSum, dp[i]);
}
return maxSum;
}
}