动态规划-279. Perfect Squares
来源:互联网 发布:mac可以玩qq堂吗 编辑:程序博客网 时间:2024/05/17 22:39
题目:
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
.
class Solution {//定义dp[i]。表示数i最少需要几个square number组成//状态转移方程:dp[i] = min(dp[i-j*j]+1) for i-j*j>=0 public int numSquares(int n){ int[] dp = new int[n+1]; dp[0] = 0; for(int i = 1; i <= n; i++){ int minV = Integer.MAX_VALUE; int j = 1; //依次挑选square number,可以重复挑选 while(i-j*j >= 0){ minV = Math.min(minV,dp[i-j*j]+1); j++; } dp[i] = minV; } return dp[n]; }}
阅读全文
0 0
- 动态规划-279. Perfect Squares
- 动态规划中级教程 279. Perfect Squares
- LeetCode 279. Perfect Squares--动态规划
- LeetCode Perfect Squares(动态规划)
- leetcode 279. Perfect Squares-完美平方数|动态规划
- Perfect Squares——动态规划
- 279.Perfect Squares
- [leetcode] 279. Perfect Squares
- 279. Perfect Squares
- 279. Perfect Squares LeetCode
- leetcode 279. Perfect Squares
- leetcode 279. Perfect Squares
- [LeetCode]279. Perfect Squares
- 279. Perfect Squares
- 279. Perfect Squares
- 279. Perfect Squares
- LeetCode-279.Perfect Squares
- LeetCode *** 279. Perfect Squares
- 2^k进制数 解题报告
- 加密证书
- 求最大子矩阵的大小——C++实现
- QSS界面美化5
- SCAUOJ——18100-奇怪的光照植物
- 动态规划-279. Perfect Squares
- poj2236 Wireless Network
- 1049. 数列的片段和(20)
- 沿着循环路线有N个加油站,其中i站的天然气量是[i]。你有一辆带有无限气罐的汽车,并且它的费用是从i站到我的下一站(i + 1).如果您可以绕电路行驶一次,则返回起始站索引
- C++——USACO Section 3.2 题解
- QSS界面美化6
- enum
- QSS界面美化7
- 获取数据自动插入列