algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 21:10:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1094 from darionyaphet/01bag

Browse Source 
修复背包理论基础01背包 java 部分代码
This commit is contained in:
程序员Carl
2022-03-07 15:59:52 +08:00
committed by GitHub
parent a27d1a454d fb67fb4320
commit b079c804a0
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
problems/背包理论基础01背包-1.md
View File

@ -271,7 +271,7 @@ int main() {
### java ### java
```java ```java
public static void main(string[] args) { public static void main(String[] args) {
int[] weight = {1, 3, 4}; int[] weight = {1, 3, 4};
int[] value = {15, 20, 30}; int[] value = {15, 20, 30};
int bagsize = 4; int bagsize = 4;
@ -292,16 +292,16 @@ int main() {
if (j < weight[i - 1]){ if (j < weight[i - 1]){
dp[i][j] = dp[i - 1][j]; dp[i][j] = dp[i - 1][j];
}else{ }else{
dp[i][j] = math.max(dp[i - 1][j], dp[i - 1][j - weight[i - 1]] + value[i - 1]); dp[i][j] = Math.max(dp[i - 1][j], dp[i - 1][j - weight[i - 1]] + value[i - 1]);
} }
} }
} }
//打印dp数组 //打印dp数组
for (int i = 0; i <= wlen; i++){ for (int i = 0; i <= wlen; i++){
for (int j = 0; j <= bagsize; j++){ for (int j = 0; j <= bagsize; j++){
system.out.print(dp[i][j] + " "); System.out.print(dp[i][j] + " ");
} }
system.out.print("\n"); System.out.print("\n");
} }
} }
``` ```