Description: Dynamic programming problem in the classical knapsack problem and its variants to explain, consists of nine, in layman' s language.
To Search:
File list (Check if you may need any files):
背包九讲
........\Pack
........\....\Index.html
........\....\Index.muse
........\....\P01.html
........\....\P01.muse
........\....\P02.html
........\....\P02.muse
........\....\P03.html
........\....\P03.muse
........\....\P04.html
........\....\P04.muse
........\....\P05.html
........\....\P05.muse
........\....\P06.html
........\....\P06.muse
........\....\P07.html
........\....\P07.muse
........\....\P08.html
........\....\P08.muse
........\....\P09.html
........\....\P09.muse
........\....\P10.html
........\....\P10.muse
........\....\P11.html
........\....\P11.muse
Download