如何分析这个题目呢，要想着当前的最优解只和前面的最优解有关

class Solution {
public:int numSquares(int n) {vector<int> f(n + 1);for (int i = 1; i <= n; i++) {int minn = INT_MAX;for (int j = 1; j * j <= i; j++) {minn = min(minn, f[i - j * j]);}f[i] = minn + 1;}return f[n];}
};

class Solution {
public:int uniquePaths(int m, int n) {int dp[105][105];for (int i = 0; i <= m; i++) {dp[0][1] = 1;for (int i = 1; i <= m; i++) {for (int j = 1; j <= n; j++) {dp[i][j] = dp[i - 1][j] + dp[i][j - 1];}}}return dp[m][n];}
};