algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 21:24:53 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat(csharp) .NET 8.0 code migration (#966)

Browse Source 
* .net 8.0 migration

* update docs

* revert change

* revert change and update appendix docs

* remove static

* Update binary_search_insertion.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

* Update binary_search_insertion.cs

* Update binary_search_edge.cs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
hpstory
2023-11-26 23:18:44 +08:00
committed by GitHub
parent d960c99a1f
commit 56b20eff36
93 changed files with 539 additions and 487 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
codes/csharp/chapter_dynamic_programming/unbounded_knapsack.cs
View File

@ -8,7 +8,7 @@ namespace hello_algo.chapter_dynamic_programming;
public class unbounded_knapsack {
/* 完全背包：动态规划 */
public int UnboundedKnapsackDP(int[] wgt, int[] val, int cap) {
int UnboundedKnapsackDP(int[] wgt, int[] val, int cap) {
int n = wgt.Length;
// 初始化 dp 表
int[,] dp = new int[n + 1, cap + 1];
@ -28,7 +28,7 @@ public class unbounded_knapsack {
}
/* 完全背包：空间优化后的动态规划 */
public int UnboundedKnapsackDPComp(int[] wgt, int[] val, int cap) {
int UnboundedKnapsackDPComp(int[] wgt, int[] val, int cap) {
int n = wgt.Length;
// 初始化 dp 表
int[] dp = new int[cap + 1];
@ -49,8 +49,8 @@ public class unbounded_knapsack {
[Test]
public void Test() {
int[] wgt = { 1, 2, 3 };
int[] val = { 5, 11, 15 };
int[] wgt = [1, 2, 3];
int[] val = [5, 11, 15];
int cap = 4;
// 动态规划