LeetCode Perfect Squares(动态规划)

题意：给出一个整数，求其等于若干个平方数的和的最小值

思路：用动态规划

具体代码如下：

public class Solution
{public int numSquares(int n){int[] f = new int[n + 1];f[0] = 0;for (int i = 1; i <= n; i++){f[i] = Integer.MAX_VALUE;int m = (int)Math.sqrt(i);for (int j = 1; j <= m; j++){f[i] = Math.min(f[i], 1 + f[i - j * j]);}}return f[n];}
}

LeetCode Perfect Squares(动态规划)相关推荐

[LeetCode]Perfect Squares
题目链接:Perfect Squares 题目内容: Given a positive integer n, find the least number of perfect square numbe ...
LeetCode Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 1 ...
LeetCode -- Perfect Squares
Question: Given a positive integer n, find the least number of perfect square numbers (for example, ...
LeetCode 279. Perfect Squares
279. Perfect Squares Given a positive integer n, find the least number of perfect square numbers (fo ...
Leetcode题解-算法-动态规划
文章目录 1.斐波那契数列 1.1 爬楼梯 1.2 强盗抢劫 1.3 环形街道抢劫 2.矩阵路径 2.1 矩阵的最小的路径和 2.2 矩阵的总路径数 3.数组区间 3.1 数组区间和 3.2 数组中等 ...
4kyu Sums of Perfect Squares
4kyu Sums of Perfect Squares 题目背景: The task is simply stated. Given an integer n (3 < n < 109) ...
【leetcode】【动态规划】股票买卖
leetcode 股票买卖(动态规划) 这位大佬四种题型总结的很好:link 一共只有三种状态:买.卖.冷冻 buy[i]buy[i]buy[i] 表示第i天之前最后一次行为是buy时,最大的收益 s ...
leetcode 279. Perfect Squares | 279. 完全平方数（动态规划，Java）
题目 https://leetcode.com/problems/perfect-squares/ 题解:动态规划参考:[宫水三叶]详解完全背包一维空间优化推导(附背包问题攻略) 首先初始化长度为 ...
leetcode -- 279. Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 1 ...

LeetCode Perfect Squares(动态规划)

LeetCode Perfect Squares(动态规划)相关推荐

最新文章

热门文章