Update dynamic_programming/Unbounded_knapsack.cpp

yeolesanskruti · realstealthninja · web-flow · commit f641dd31116f · 2024-10-08T21:26:15.000+05:30
Co-authored-by: realstealthninja &lt;68815218+realstealthninja@users.noreply.github.com&gt;
diff --git a/dynamic_programming/Unbounded_knapsack.cpp b/dynamic_programming/Unbounded_knapsack.cpp
@@ -9,7 +9,7 @@
  * @task Given a set of N items, each with a weight and a value, represented by the array `wt` and `val` respectively, and a knapsack 
  * with a weight limit W, the task is to fill the knapsack in such a way that the maximum profit is obtained. Return the maximum profit.
  * 
- * Note: Each item can be taken any number of times.
+ * @note Each item can be taken any number of times.
  *
  * @author [Sanskruti Yeole](https://github.com/yeolesanskruti)
  * @see dynamic_programming/Unbounded_knapsack.cpp

Original file line number	Diff line number	Diff line change
`@@ -9,7 +9,7 @@`
`9`	`9`	* @task Given a set of N items, each with a weight and a value, represented by the array `wt` and `val` respectively, and a knapsack
`10`	`10`	`* with a weight limit W, the task is to fill the knapsack in such a way that the maximum profit is obtained. Return the maximum profit.`
`11`	`11`	`*`
`12`		`- * Note: Each item can be taken any number of times.`
	`12`	`+ * @note Each item can be taken any number of times.`
`13`	`13`	`*`
`14`	`14`	`* @author [Sanskruti Yeole](https://github.com/yeolesanskruti)`
`15`	`15`	`* @see dynamic_programming/Unbounded_knapsack.cpp`