algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 01:18:23 +08:00
Code Issues Packages Projects Releases Wiki Activity

Style Changed as per guidelines

Browse Source
This commit is contained in:
Omkarnath Parida
2020-10-04 22:27:53 +05:30
parent 8a40a08f3e
commit 7a65d8929f
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
Dynamic-Programming/ZeroOneKnapsack.js
View File

@ -4,18 +4,18 @@
*/ */
function zeroOneKnapsack (arr, n, cap, cache) { function zeroOneKnapsack (arr, n, cap, cache) {
if (cap == 0 || n == 0) { if (cap === 0 || n === 0) {
cache[n][cap] = 0 cache[n][cap] = 0
return cache[n][cap] return cache[n][cap]
} }
if (cache[n][cap] != -1) { if (cache[n][cap] !== -1) {
return cache[n][cap] return cache[n][cap]
} }
if (arr[n - 1][0] <= cap) { if (arr[n - 1][0] <= cap) {
cache[n][cap] = Math.max(arr[n - 1][1] + zeroOneKnapsack (arr, n - 1, cap - arr[n - 1][0], cache), zeroOneKnapsack (arr, n - 1, cap, cache)) cache[n][cap] = Math.max(arr[n - 1][1] + zeroOneKnapsack(arr, n - 1, cap - arr[n - 1][0], cache), zeroOneKnapsack(arr, n - 1, cap, cache))
return cache[n][cap] return cache[n][cap]
} else { } else {
cache[n][cap] = zeroOneKnapsack (arr, n - 1, cap, cache) cache[n][cap] = zeroOneKnapsack(arr, n - 1, cap, cache)
return cache[n][cap] return cache[n][cap]
} }
} }
@ -44,7 +44,7 @@ function main () {
while (i < length) { while (i < length) {
const cap = Number(input[i].trim().split(' ')[0]) const cap = Number(input[i].trim().split(' ')[0])
const currlen = Number(input[i].trim().split(' ')[1]) const currlen = Number(input[i].trim().split(' ')[1])
let j = i + 1; let j = i + 1
const arr = [] const arr = []
while (j <= i + currlen) { while (j <= i + currlen) {
arr.push(input[j]) arr.push(input[j])
@ -68,4 +68,4 @@ function main () {
} }
} }
main() main()