试图找到与M美分找头相应的最小硬币数。
DPCHANGE(M,c,d)
bestNumCoins0<-0
for m<-1 toM
bestNumCoinsm<-∞
fori<-1 to d
if m>=Ci
if bestNumCoinsm-Ci+1<bestNumCoinsm
bestNumCoinsm <-bestNumCoinsm-Ci+1
return bestNumCoinsm
试图找到与M美分找头相应的最小硬币数。
DPCHANGE(M,c,d)
bestNumCoins0<-0
for m<-1 toM
bestNumCoinsm<-∞
fori<-1 to d
if m>=Ci
if bestNumCoinsm-Ci+1<bestNumCoinsm
bestNumCoinsm <-bestNumCoinsm-Ci+1
return bestNumCoinsm