动态规划,时间复杂度O(N^(3/2))
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n+1,INT_MAX);
dp[0] = 0;
dp[1] = 1;
for(int i=2;i<=n;i++){
for(int j=1;j*j<=i;j++){
dp[i] = min(dp[i-j*j]+1,dp[i]);
}
}
return dp[n];
}
};
BFS做法待续