static int maxM = 5;
static int count = 0;
@interface ViewController ()
@end
@implementation ViewController
- (void)viewDidLoad {
[super viewDidLoad];
// Do any additional setup after loading the view, typically from a nib.
int m[10] = {5,2,3,4,9,6,7,8,1,10};
int m_t[10] = {0};
knap(m, 0,m_t);
}
/**
设一个背包容纳的物品最大质量为m,现有n件物品,质量为m1,m2,… ,mn,均为正整数。要求从中挑选若干件,使背包质量之和正好为m.
(在此问题中,第i件物品要么取,要么不取,不能取一部分,故问题可能有解,可能无解)
*/
void knap(int *m, int n,int *m_t) {
if (n <10) {
int sum = 0;
for (int i = 0; i<10; i++) {
sum += m_t[i];
}
if (sum == maxM) {
printf("第%02d个: = ",count+1);
for (int i = 0; i<10; i++) {
printf(" %d ",m_t[i]);
}
printf("\n");
count++;
}else {
for (int i = 0; i<10; i++) {
if (m_t[i] == 0) { //表示当前的是可以插入值
m_t[i] = m[i]; //放入一个值
knap(m, n+1,m_t);//放入其余的数
m_t[i] = 0;//还原
}
}
}
}
}
递归5_简单的0/1背包问题
最新推荐文章于 2022-11-21 10:37:35 发布