RE: Algorithms Series: 0/1 BackPack ACM题解 - 经典0/1背包问题

You are viewing a single comment's thread from:

Algorithms Series: 0/1 BackPack ACM题解 - 经典0/1背包问题

in programming •  7 years ago 

赞,只要着重讲解动态规划方程就行,程序实现写多了感觉帮助不大,看着方程自己实现就好了。

Authors get paid when people like you upvote their post.
If you enjoyed what you read here, create your account today and start earning FREE STEEM!