题目描述:
给定正整数 n,找到若干个完全平方数(比如 1, 4, 9, 16, …)使得它们的和等于 n。你需要让组成和的完全平方数的个数最少。
示例 1:
输入: n = 12
输出: 3
解释: 12 = 4 + 4 + 4.
示例 2:
输入: n = 13
输出: 2
解释: 13 = 4 + 9.
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/perfect-squares
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解法:
class Solution {
public int numSquares(int n) {
int[] dp = new int[n+1];
Arrays.fill(dp,Integer.MAX_VALUE);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i < dp.length; i++) {
int temp = (int)Math.sqrt(i);
if(temp*temp == i){
dp[i] = 1;
continue;
}
for (int j = 1; j <= i/2; j++) {
dp[i] = Math.min(dp[i-j]+dp[j],dp[i]);
}
}
return dp[n];
}
}
优化解法,来源题解:
class Solution {
public int numSquares(int n) {
int[] dp = new int[n+1];
for (int i = 1; i < dp.length; i++) {
dp[i] = i;
for (int j = 1; j*j <= i; j++) {
dp[i] = Math.min(dp[i-j*j]+1,dp[i]);//前位置记录的情况+某个平方数最小(即个数+1)的情况
}
}
return dp[n];
}
}
bfs解法:
class Solution {
class Node {
private int val;
private int step;
public Node(int val, int step) {
this.val = val;
this.step = step;
}
}
public int numSquares(int n) {
Queue<Node> que = new LinkedList<>();
que.add(new Node(n,1));
boolean[] mark = new boolean[n];
while (!que.isEmpty()){
int val = que.peek().val;
int step = que.peek().step;
que.remove();
for (int i = 1; i <= val; i++) {
int next = val - i*i;
if(next < 0){
break;
}
if(next == 0){
return step;
}
if(!mark[next]){
que.add(new Node(next,step+1));
mark[next] = true;
}
}
}
return -1;
}
}