forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHoonDongKang.ts
More file actions
36 lines (29 loc) · 833 Bytes
/
HoonDongKang.ts
File metadata and controls
36 lines (29 loc) · 833 Bytes
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
/**
* [Problem]: [53] Maximum Subarray
*
* (https://leetcode.com/problems/maximum-subarray/description/)
*/
function maxSubArray(nums: number[]): number {
//시간복잡도 O(n)
//공간복잡도 O(1)
function getMax(nums: number[]): number {
let result = nums[0];
let sum = 0;
nums.forEach((num) => {
sum = Math.max(num, sum + num);
result = Math.max(sum, result);
});
return result;
}
//시간복잡도 O(n)
//공간복잡도 O(1)
function dpFunc(nums: number[]): number {
const dp = Array(nums.length).fill(0);
dp[0] = nums[0];
for (let i = 1; i < nums.length; i++) {
dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
}
return Math.max(...dp);
}
return dpFunc(nums);
}