Q:
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.
For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return 2 because 13 = 4 + 9.
题意:给你一个正整数,计算它能够被表示为最少个数的平方和,并求出最少的个数。有点绕,不过英文也比较好理解啦
solution:
这道题和之前那道coin change几乎一模一样:
(LeetCode 322) Coin Change.
当然,解法也有动态规划和BFS算法两种,大家要感兴趣直接参考那道题的解法就好,我这贴上这道题的BFS算法和DP的代码。
BFS (248 ms):
class Solution {
public:
queue<int> pq1;
queue<int> pq2;
int numSquares(int n) {
if(n==0)return 0;
vector<int> visit=vector<int>(n,0);
for(int i=1;i<=int(sqrt(n));i++)
{
pq1.push(n-i*i);
visit[n-i*i]=1;
//cout<<n-i*i<<endl;
}
for(int count=1;count<=n;count++){
queue<int> &pq3 = (count%2!=0)?pq1:pq2;
queue<int> &pq4 = (count%2!=0)?pq2:pq1;
while(!pq3.empty()){
int temp = pq3.front();
pq3.pop();
// cout<<temp<<endl;
if(temp==0)return count;
for(int k=1;k<=int(sqrt(temp));k++){
if(temp-k*k<0)continue;
if(visit[temp-k*k]==1)continue;
pq4.push(temp-k*k);
//cout<<temp-k*k<<endl;
visit[temp-k*k]=1;
}
}
}
return n;
}
};
DP(340 ms):
class Solution {
public:
int numSquares(int n) {
if(n==0)return 0;
int *dp = new int[n+1];
dp[1]=1;
for(int i=2;i<=n;i++){
int min= n+1;
for(int j=1;j<=int(sqrt(i));j++){
min = (min<dp[i-j*j]+1)?min:dp[i-j*j]+1;
if(j*j==i)min=1;
}
dp[i]=min;
}
return dp[n];
}
};