int knap(int cap)
{
int i, space, max, t;
for (i = 0, max = 0; i N; i++)
if ((space = cap-items.size) >= 0)
if ((t = knap(space) + items.val) > max)
max = t;
return max;
}
动态规划实现：
int knap(int M)
{
int i, space, max, maxi, t;
if (maxKnown[M] != unknown) return maxKnown[M];
for (i = 0, max = 0; i N; i++)
if ((space = M-items.size) >= 0)
if ((t = knap(space) + items.val) > max)
{ max = t; maxi = i; }
maxKnown[M] = max; itemKnown[M] = items[maxi];
return max;
}