LeetCode: Perfect Squares
来源:互联网 发布:51单片机片内资源 编辑:程序博客网 时间:2024/05/18 02:20
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
.
int numSquares(int n) { if (n <= 1) return 1; int logn = sqrt(n); int *res = (int*)malloc((n + 1) * sizeof(int)); memset(res, 0, (n + 1) * sizeof(int)); for (int i = 0; i <= logn; ++i) res[i * i] = 1; for (int i = 2; i <= n; ++i) { if (res[i] != 0) continue; int tmp = res[i - 1] + 1; int logi = sqrt(i); for (int j = 2; j <= logi; ++j) { if (tmp > res[i - j * j] + 1) tmp = res[i - j * j] + 1; } res[i] = tmp; } return res[n];}
1 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
- vim 命令 汇总
- jquery easyui datagrid使用参考
- BOM编码格式
- POJ 3173 模拟
- zlt尼玛银行,深度学习Redis(一) 关系型与非关系型数据库使用方式的转变过程
- LeetCode: Perfect Squares
- 2分查找(折半查找)算法
- python插入排序
- HDU 1011 Starship Troopers
- white list 机制
- POJ 3273 二分答案
- 【Thinking in Java】控制执行流程
- Spring与SpringMVC的容器关系分析
- 中秋前夜,和老师长谈