题:https://leetcode.com/problems/perfect-squares/description/
题目
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.
Example 1:
Input: n = 12
Output: 3
Explanation: 12 = 4 + 4 + 4.
Example 2:
Input: n = 13
Output: 2
Explanation: 13 = 4 + 9.
题目大意
给定一个数 n, 找出 数量最少 平方数的和为n, 输出数量。
思路
方法一
BFS 从 n减去 平方数的多个remainder, 作为树的第二层,同理当 remainder 为 0 时,返回。remainder < 0 时,减枝。
参考:https://leetcode.com/problems/perfect-squares/discuss/71475/Short-Python-solution-using-BFS
这个方法 对 求 无限组合问题 特别适用。Note:BFS 求 最少数量问题。
class Solution {
public int numSquares(int n) {
int squarelen = (int) Math.sqrt(n);
int[] squares = new int[squarelen];
for (int i = 1 ;i <= squarelen;i++)
squares[i-1] = i*i;
Queue<Integer> queue = new LinkedList<>();
boolean[] marked = new boolean[n+1];
queue.offer(n);
marked[n] = true;
int level = 0;
while(!queue.isEmpty()){
int queueSize = queue.size();
level++;
while(queueSize-->0){
int curRemainder = queue.poll();
for(int j = 0;j < squarelen;j++){
int remainder = curRemainder - squares[j];
if(remainder < 0 )
break;
else if(remainder==0)
return level;
if(marked[remainder])
continue;
marked[remainder] = true;
queue.offer(remainder);
}
}
}
return n;
}
}
方法二 dp
dp
状态dp[i]:为 i 的完美平法数。
初速化状态:dp[0] = 0;
状态转移方程:dp[i] = min([dp[i-j]+1 for j in sqrValue if j<=i]),即 dp[i] = min(dp[i], d[i-j*j]+1) , 其中 j 为 for(int j =1 ; j * j <= i; i++) ,dp[i]的初始值为 i,dp[i] 最差是 i 个 1 的和。
动态方法 从底到高。
class Solution {
public int numSquares(int n) {
int[] dp = new int[n + 1];
dp[0] = 0;
int sqrValuelen = (int)Math.sqrt(n);
int[] sqrValueArray = new int[n];
for(int i = 1;i<=sqrValuelen;i++)
sqrValueArray[i-1] = i*i;
for(int i = 1;i<=n;i++){
dp[i] = i;
for(int j = 0;j<sqrValueArray.length;j++){
if(sqrValueArray[j]>i)
break;
dp[i] = Math.min(dp[i],dp[i-sqrValueArray[j]]+1);
}
}
return dp[n];
}
}