Leetcode Perfect Squares
来源:互联网 发布:论文查重软件免费 编辑:程序博客网 时间:2024/06/06 12:42
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
.
Difficulty: Medium
Solution: DP
public class Solution { public int numSquares(int n) { int max = (int) Math.sqrt(n); int[] dp = new int[n+1]; Arrays.fill(dp, Integer.MAX_VALUE); for(int i=1; i<=n; i++){ for(int j=1; j<=max; j++){ if(i==j*j){ dp[i]=1; }else if(i>j*j){ dp[i]=Math.min(dp[i], dp[i-j*j] + 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
- iOS 【快速集成QQ表情键盘】
- Leetcode Unique Word Abbreviation
- iOS 【Runtime 初理解】
- Ruby中的各种方法定义和调用(函数式方法|实例方法|类方法)
- Leetcode Summary Ranges
- Leetcode Perfect Squares
- iOS 【UIKit-方法- (void)loadView; 的详解】
- JAVA中的static关键字
- 如何从官网下载 Google Chrome 离线安装包
- Navicat 导入sql脚本文件
- sublime用nodejs直接运行js
- windows快捷方式
- centos ping不通内网 网关 外网 域名等以解决 通过设置为动态IP(启用dhcp协议)
- redis入门