C++动态规划 求换取指定数额钱币的最少货币数 普通动态规划和空间压缩方法

#include <iostream>


const int max = 65535;
int minCoins(int arr[], int aim, int length);
int minCoinsPro(int arr[], int aim, int length);


int main()
{
int arr[7] = { 5, 2, 5, 3, 4, 5, 7};
int aim = 31;
int length = std::end(arr) - std::begin(arr);


std::cout << minCoins(arr, aim, length) << std::endl;
std::cout << minCoinsPro(arr, aim, length) << std::endl;




system("pause");
return 0;
}


int minCoins(int arr[], int aim, int length)
{
if (arr == nullptr || aim < 0 || length < 0)
{
return -1;
}


int sum = 0;
int **pArr = new int*[length]; //动态生成二维数组
for (int i = 0; i < length; ++i)
{