Leetcode 279. Perfect Squares
来源:互联网 发布:顺序表逆置算法 编辑:程序博客网 时间:2024/06/01 21:21
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
.
简单DP,从1开始向上转移。
class Solution {public: int numSquares(int n) { vector<int> dp(n + 1, INT_MAX); dp[0] = 0; for(int i = 1; i <= n; i++ ) for(int j = 1; j <= sqrt(i); j++) dp[i] = min(dp[i], dp[i - j * j] + 1); return dp[n]; }};
1 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
- 继承,菱形继承,多态,虚继承、菱形虚拟继承
- python调用win32实现电脑语音
- Drawable中的动画机制
- Huatuo's Medicine HDU
- 从RPC开始(一)
- Leetcode 279. Perfect Squares
- 聊聊这次概论心得
- 在Altium Designer中更改走线间最小间距的方法
- 《精彩绝伦的CSS》——选择器(五)多种选择方式
- Logback 代码编写(一)
- 【计算机网络】局域网
- MySQL数据库的导入导出
- 作业2
- 鸡兔同笼[题目不难,提醒自己注意细节!!!]