leetcode:数学:Perfect Squares(279)
来源:互联网 发布:淘宝注册资金要多少钱 编辑:程序博客网 时间:2024/05/22 02:05
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.
class Solution {public: int numSquares(int n) { while (n % 4 == 0) n /= 4; if (n % 8 == 7) return 4; for (int a = 0; a * a <= n; ++a) { int b = sqrt(n - a * a); if (a * a + b * b == n) { return !!a + !!b; } } return 3; }};
0 0
- leetcode:数学:Perfect Squares(279)
- 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:279Perfect Squares
- [LeetCode 279] Perfect Squares
- Perfect Squares - LeetCode 279
- 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
- android 自定义dialog的简单实现
- POJ 3667 Hotel 区间合并+线段树 *
- 组合模式
- 深入理解Android(一):Gradle详解
- 书那么多,从第一页翻到最后肯定行不通了
- leetcode:数学:Perfect Squares(279)
- 【SQLSERVER】执行字符串
- 基于hadoop生态圈的数据仓库实践 —— OLAP与数据可视化(五)
- mysql建索引原则及索引区别
- 三种常见设置字体的单位比较
- HTML学习笔记
- Hadoop 环境配置和第一个例子
- Apache Mahout&Maven安装
- 对码农而言什么样的代码才能叫做好代码?