*LeetCode-Perfect Squares
来源:互联网 发布:淘宝上买警官证 编辑:程序博客网 时间:2024/05/16 08:56
本来以为可以像combination sum一样用backtracking, 结果超时了
用dp 要想清楚每个位置的数字是如何得来的 这个位置时 min( dp[ i + j * j ], dp [ i ] + 1 ) 第一个代表就是原来的值,第二个代表用 i + j * j来组成n
注意java array initialize 用fill
其次要注意两层循环的边界
public class Solution { public int numSquares(int n) { int [] dp = new int [ n + 1 ]; Arrays.fill ( dp, Integer.MAX_VALUE); dp [ 0 ] = 0; for ( int i = 0; i < n; i ++ ){ for ( int j = 1; i + j * j <= n; j ++ ){ dp [ i + j * j ] = Math.min( dp[ i + j * j], dp[ i ] + 1 ); } } return dp[n]; }}
0 0
- leetcode 279: Perfect Squares
- [Leetcode]Perfect Squares
- Leetcode 279 Perfect Squares
- Leetcode #279 Perfect Squares
- [leetcode 279]Perfect Squares
- Leetcode:279Perfect Squares
- Leetcode Perfect Squares
- LeetCode Perfect Squares
- leetcode Perfect Squares
- leetcode: Perfect Squares
- [LeetCode 279] Perfect Squares
- LeetCode -- Perfect Squares
- *LeetCode-Perfect Squares
- LeetCode----Perfect Squares
- [LeetCode]Perfect Squares
- Perfect Squares - LeetCode 279
- [Leetcode] Perfect Squares
- Perfect Squares -- leetcode
- 文章标题
- 创建keil project(89C52)并且仿真流水灯
- 对parseInt的深入理解
- 多点触控及一个华丽的Demo
- Linux上安装DB2
- *LeetCode-Perfect Squares
- JDBC和JTA事务区别
- vc2010下mongodb驱动的编译与环境搭建
- Big Data 学习笔记【1】
- EJB面试题
- Ember.js 入门指南——工具类的助手
- autocomplete 自动填充 类似百度查找
- 普及X64 ssdtshadow inline HOOK
- EventBus实现activity跟fragment交互数据