Leetcode 633 Sum of Square Numbers
2017-09-11 08:49
344 查看
Leetcode 633 Sum of Square Numbers
#include <math.h> class Solution { public: bool judgeSquareSum(int c) { for(int i = 0;i <= (int)sqrt(c);i++) { double tmp = c - i * i; if(sqrt(tmp) == (int)sqrt(tmp))//only two numbers' square sum return true; } return false; } };
相关文章推荐
- LeetCode 633 : Sum of Square Numbers(python)
- LeetCode 633 Sum of Square Numbers
- leetcode[Sum of Square Numbers]
- [LeetCode] Sum of Square Numbers 平方数之和
- LeetCode Sum of Square Numbers
- Math-633-Sum of Square Numbers
- 【LeetCode】Sum of Square Numbers 解题报告
- Sum of Square Numbers问题描述
- [LeetCode] Print All Combinations of a Number as a Sum of Candidate Numbers
- Sum of Square Numbers
- [LeetCode] Print All Combinations of a Number as a Sum of Candidate Numbers
- LeetCode.50(69\367\633) Pow(x,n)&&Sqrt(x)&&Valid Perfect Square&&Sum of Square Numbers
- perfect squares find the least number of perfect square numbers (1, 4, 9, 16, ...) which sum to n
- [leetcode]Sum Root to Leaf Numbers
- LeetCode-Sum Root to Leaf Numbers
- LeetCode[Bitwise]----Bitwise AND of Numbers Range
- [LeetCode][JavaScript]Count of Smaller Numbers After Self
- 129.leetcode Sum Root to Leaf Numbers(medium)[深度遍历DFS]
- [Haskell] CodeWars|Sum of odd numbers
- Leetcode 129 Sum Root to Leaf Numbers