class Solution {
public:
int numSquares(int n) {
vector<int> res(n+1,0x7FFFFFFF);
res[0] = 0;
for(int i = 1; i <= n;i++){
for(int j = 1;i-j*j>=0;j++){
res[i] = min(res[i],res[i-j*j] + 1);
}
}
return res[n];
}
};
完全平方数
最新推荐文章于 2021-06-11 11:48:15 发布