找零钱 dp

debug版本

#include<iostream>
#include<cstring>
using namespace std;
int giveChange(int* dp, int dpLen, int* v, int vLen, int* dpCount);
int printAns(int* dp, int dpLen, int* v, int vLen,int* dpCount);
int main(){
    int myMoney,price;
    int v[] = {1,2,5,11,20,50};
    cout << "物品价格（美分）:";
    cin >> price;
    cout <<"支付的金额（美分）:";
    cin >> myMoney;
    int n = myMoney - price;
    int dp[n+1];
    int dpCount[n+1];
    int ans = giveChange(dp, n+1, v, 6, dpCount);
    cout << "硬币的个数是：" <<ans << endl;
    printAns(dp,n+1,v,6, dpCount);
    return 0;
}
int giveChange(int* dp, int dpLen, int* v, int vLen,int* dpCount){
    for(int i = 0; i < dpLen; i++) dp[i] = 0;
    for(int i = 0; i < dpLen; i++) dpCount[i] = 0;
    for(int i = 1; i < dpLen; i++){
        int nmin = 9999, kmin;
        for(int k = 0; k < vLen; k++){
            if(i-v[k]>=0){
                if(nmin > dp[i-v[k]]+1){
                    nmin = dp[i-v[k]]+1;
                    kmin = k;
                }
            }
        }
        dp[i] = nmin;
        dpCount[i] = kmin;
    }
    return dp[dpLen-1];
}
int printAns(int* dp, int dpLen, int* v, int vLen,int* dpCount){
    for(int i = 0; i < dpLen; i++) {
        cout << "dpCount["<< i << "] : " <<dpCount[i] << " "<< v[dpCount[i]] << " " << i-v[dpCount[i]] << endl;
    }
    int index = dpLen-1;
    int t = dpLen-1;
    cout << "t:" << t << endl;
    while(t != -1){
        cout << v[dpCount[index]] << " " ;
        index = index - v[dpCount[index]];
        t = index-v[dpCount[index]];
    }
}

提交作业最终精简版

#include<iostream>
#include<cstring>
using namespace std;
int giveChange(int* dp, int dpLen, int* v, int vLen, int* dpCount);
int printAns(int* dp, int dpLen, int* v,int* dpCount);
int main(){
    int myMoney,price;
    int v[] = {1,2,5,11,20,50};
    cout << "物品价格（美分）:";
    cin >> price;
    cout <<"支付的金额（美分）:";
    cin >> myMoney;
    int n = myMoney - price;
    int dp[n+1];
    int dpCount[n+1];
    int ans = giveChange(dp, n+1, v, 6, dpCount);
    cout << "硬币的个数是：" <<ans << endl;
    printAns(dp,n+1,v,dpCount);
    return 0;
}
int giveChange(int* dp, int dpLen, int* v, int vLen,int* dpCount){
    for(int i = 0; i < dpLen; i++) dp[i] = 0;
    for(int i = 0; i < dpLen; i++) dpCount[i] = 0;
    for(int i = 1; i < dpLen; i++){
        int nmin = 9999, kmin;
        for(int k = 0; k < vLen; k++){
            if(i-v[k]>=0){
                if(nmin > dp[i-v[k]]+1){
                    nmin = dp[i-v[k]]+1;
                    kmin = k;
                }
            }
        }
        dp[i] = nmin;
        dpCount[i] = kmin;
    }
    return dp[dpLen-1];
}
int printAns(int* dp, int dpLen, int* v,int* dpCount){
    int index = dpLen-1;
    while(index != 0){
        cout << v[dpCount[index]] << " " ;
        index = index - v[dpCount[index]];
    }
}