Skip to content

dabin #136

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
davinahi wants to merge 2 commits into
base: main
Choose a base branch
from
Open

dabin #136

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
28f07a9
dabin
Dec 23, 2022
b915320
Merge branch 'main' into dabin
davinahi Dec 23, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 23 additions & 1 deletion Dynamic Programming I/day5/53.MaximumSubarray.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,24 @@

var kimMaxSubArray = function(nums) {
// let result = 0;
// for(let i = 1; i < nums.length; i++){
// nums[i] = Math.max(nums[i] + nums[i - 1], nums[i])
// console.log(nums[i])
// result = nums[i]

// }

// return Math.max(result)
for(let i = 1; i < nums.length; i++){
nums[i] = Math.max(nums[i], nums[i]+nums[i-1])
console.log(nums[i])
}

return Math.max(...nums)
};

console.log(kimMaxSubArray([5,4,-1,7,8]))

//* doeun ----------------------------------------------------------------------------------------------------------------------------------
const hwangmaxSubArray = function(nums) {
let sum = nums[0];
Expand All @@ -23,4 +44,5 @@ const choiMaxSubArray = function(nums) {
}

return max;
};
};