使用递归的方式求礼物的最大价值，最大的遗憾是目前还不知道如何将最优路径在不保存每条路径的情况下打印出来。
/** *Copyright @ 2019 Zhang Peng. All Right Reserved. *Filename: *Author: Zhang Peng *Date: *Version: *Description:剑指offer<第二版> 面试题47 礼物的最大价值 **/ #include<iostream> using namespace std; const int m = 4, n = 4; int comGiftValue(int matrix[m][n],int row,int col,int maxrow,int maxcol) { int result = 0; if (row > maxrow || col > maxcol) return 0; else result += matrix[row][col]; if (row == maxrow && col == maxcol) return result; int result1 = comGiftValue(matrix, row + 1, col, maxrow, maxcol); int result2 = comGiftValue(matrix, row, col + 1, maxrow, maxcol); if (result1 > result2) return result + result1; else return result + result2; } int main() { int testcase[m][n] = { { 1, 10, 3, 8 }, { 12, 2, 9, 6 }, { 5, 7, 4, 11 }, { 3, 7, 16, 5 } }; int sum = comGiftValue(testcase, 0, 0, m - 1, n - 1); cout << sum << endl; system("pause"); return 0; }运行结果如下：
