mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
20 lines
490 B
JavaScript
20 lines
490 B
JavaScript
/*
|
|
* You are given a rod of 'n' length and an array of prices associated with all the lengths less than 'n'.
|
|
* Find the maximum profit possible by cutting the rod and selling the pieces.
|
|
*/
|
|
|
|
export function rodCut(prices, n) {
|
|
const memo = new Array(n + 1)
|
|
memo[0] = 0
|
|
|
|
for (let i = 1; i <= n; i++) {
|
|
let maxVal = Number.MIN_VALUE
|
|
for (let j = 0; j < i; j++) {
|
|
maxVal = Math.max(maxVal, prices[j] + memo[i - j - 1])
|
|
}
|
|
memo[i] = maxVal
|
|
}
|
|
|
|
return memo[n]
|
|
}
|