Commit660c737

authored

feat(dynamic programming -> knapsack): Update invalid example comment

1 parent19b4ced commit660c737Copy full SHA for 660c737

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@`
`6`	`6`	`*@returns Maximum value subset such that sum of the weights of this subset is smaller than or equal to capacity`
`7`	`7`	`*@throws If weights and values arrays have different lengths`
`8`	`8`	`*@see [Knapsack](https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/)`
`9`		`- *@example knapsack(3, [3, 4, 5], [30, 50, 60]) // Output:90`
	`9`	`+ *@example knapsack(3, [3, 4, 5], [30, 50, 60]) // Output:30`
`10`	`10`	`*/`
`11`	`11`
`12`	`12`	`exportconstknapsack=(`

Comments

(0)