Leetcode 279. Perfect Squares
来源:互联网 发布:元泰茶业淘宝 编辑:程序博客网 时间:2024/05/16 07:27
问题描述
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
.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
问题分析:
把target分成两个数,然后分别两个数的最少平方和的数目相加即为target的最少平和的数目。
代码如下:
public int numSquares(int n) { if(n<=0) return 0; int[]dp=new int[n+1]; dp[0]=0; dp[1]=1; int index=2; for(int i=2;i<=n;i++){ if(i==index*index) { dp[i]=1; index++; } else{ dp[i]=Integer.MAX_VALUE; for(int j=1;j<=i/2;j++){ dp[i]=Math.min(dp[i],dp[j]+dp[i-j]); } } } return dp[n]; }
阅读全文
0 0
- [leetcode] 279. Perfect Squares
- 279. Perfect Squares LeetCode
- leetcode 279. Perfect Squares
- leetcode 279. Perfect Squares
- [LeetCode]279. Perfect Squares
- LeetCode-279.Perfect Squares
- LeetCode *** 279. Perfect Squares
- leetcode.279. Perfect Squares
- LeetCode 279. Perfect Squares
- [leetcode] 279. Perfect Squares
- Leetcode-279. Perfect Squares
- LeetCode 279. Perfect Squares
- Leetcode 279. Perfect Squares
- [LeetCode]279. Perfect Squares
- 【LeetCode】 279. Perfect Squares
- (LeetCode) 279. Perfect Squares
- LeetCode 279. Perfect Squares
- LeetCode#279. Perfect Squares
- TensorFlow 变量管理
- 输入一个整数数组,实现一个函数来调整该数组中数字的顺序,使得所有的奇数位于数组的前半部分,所有的偶数位于位于数组的后半部分,并保证奇数和奇数,偶数和偶数之间的相对位置不变。
- [USACO2.2]Party Lamps派对灯
- Docker的好处作用
- http状态码代表的意思
- Leetcode 279. Perfect Squares
- html页面怎样逐级加载多个嵌套ifrme中的内容
- CentOS 7.2重启网络报错 Failed to start LSB: Bring up/down---liux报错
- java编程思想-----笔记(一)____万物皆对象
- 微信jssdk开发域名问题
- PBS常用命令和脚本
- gnuplot 使用时遇到的问题
- 同步异步&阻塞非阻塞
- 2、多媒体标签 embed