Commit aa22b80

committed

添加背包理论基础01-2.mc C语言版本

1 parent 4defb3d commit aa22b80Copy full SHA for aa22b80

File tree

+33

-0

lines changed

+33

-0

lines changed

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -315,6 +315,39 @@ function test () {`
`315`	`315`	`test();`
`316`	`316`	```
`317`	`317`
	`318`	`+### C`
	`319`	+```c
	`320`	`+#include <stdio.h>`
	`321`	`+#include <string.h>`
	`322`	`+`
	`323`	`+#define MAX(a, b) (((a) > (b)) ? (a) : (b))`
	`324`	`+#define ARR_SIZE(arr) ((sizeof((arr))) / sizeof((arr)[0]))`
	`325`	`+#define BAG_WEIGHT 4`
	`326`	`+`
	`327`	`+void test_back_pack(int* weights, int weightSize, int* values, int valueSize, int bagWeight) {`
	`328`	`+ int dp[bagWeight + 1];`
	`329`	`+ memset(dp, 0, sizeof(int) * (bagWeight + 1));`
	`330`	`+`
	`331`	`+ int i, j;`
	`332`	`+ // 先遍历物品`
	`333`	`+ for(i = 0; i < weightSize; ++i) {`
	`334`	`+ // 后遍历重量。从后向前遍历`
	`335`	`+ for(j = bagWeight; j >= weights[i]; --j) {`
	`336`	`+ dp[j] = MAX(dp[j], dp[j - weights[i]] + values[i]);`
	`337`	`+ }`
	`338`	`+ }`
	`339`	`+`
	`340`	`+ // 打印最优结果`
	`341`	`+ printf("%d\n", dp[bagWeight]);`
	`342`	`+}`
	`343`	`+`
	`344`	`+int main(int argc, char** argv) {`
	`345`	`+ int weights[] = {1, 3, 4};`
	`346`	`+ int values[] = {15, 20, 30};`
	`347`	`+ test_back_pack(weights, ARR_SIZE(weights), values, ARR_SIZE(values), BAG_WEIGHT);`
	`348`	`+ return 0;`
	`349`	`+}`
	`350`	+```
`318`	`351`
`319`	`352`
`320`	`353`	`-----------------------`

Comments

(0)