LeetCode-633. Sum of Square Numbers
2018-02-25 18:32
190 查看
Description
Example 1
Example 2
Solution 1(C++)
class Solution { public: bool judgeSquareSum(int c) { for(int i=0;i<=sqrt(c);i++){ int j=c-i*i; if(sqrt(j)==(int)sqrt(j)){ return true; } } return false; } };
Solution 2(C++)
class Solution { public: bool judgeSquareSum(int c) { for(int i=0;i<=sqrt(c);i++) { int t=sqrt(c-i*i); if(t*t==c-i*i) return true; } return false; } };
Solution 3(C++)
class Solution { public: bool judgeSquareSum(int c) { int a = 0, b = sqrt(c); while(a <= b){ if(a*a + b*b == c)return true; else if(a*a + b*b > c)b--; else a++; } return false; } };
算法分析
解法一与解法二是原理上是相同的。解法三也可以学习学习。程序分析
略。相关文章推荐
- [LeetCode]633. Sum of Square Numbers
- 2017.12.25 LeetCode 633. Sum of Square Numbers【思维枚举】
- LeetCode 633. Sum of Square Numbers
- LeetCode Sum of Square Numbers
- LeetCode 633 : Sum of Square Numbers(python)
- Leetcode 633 Sum of Square Numbers
- leetcode[Sum of Square Numbers]
- [LeetCode] Sum of Square Numbers 平方数之和
- LeetCode 633 Sum of Square Numbers
- 633. Sum of Square Numbers
- 【LeetCode】Sum of Square Numbers 解题报告
- LeetCode之2_Add Two Numbers
- LeetCode -- Maximal Square
- Leetcode算法学习日志-386 Lexicographical Numbers
- LeetCode - Sum Root to Leaf Numbers
- [LeetCode] Sum Root to Leaf Numbers
- 【LeetCode】728. Self Dividing Numbers 解题报告
- [leetcode 4] Add Two Numbers
- LeetCode 628 Maximum Product of Three Numbers
- Leetcode--Add Two Numbers