[LeetCode]633. Sum of Square Numbers
2017-09-20 00:39
253 查看
[LeetCode]633. Sum of Square Numbers
题目描述
思路
有点类似tow sum 从两边找,low的边界是0,high的边界是输入num的平方根取整代码
#include <iostream> #include <vector> #include <algorithm> using namespace std; class Solution { public: bool judgeSquareSum(int c) { int high = sqrt(c), low = 0; while (low <= high) { int res = low * low + high * high; if (res == c) return true; else if (res < c) ++low; else --high; } return false; } }; int main() { int num; Solution s; while (cin >> num) { cout << s.judgeSquareSum(num) << endl; } }
相关文章推荐
- [leetcode]633. Sum of Square Numbers
- [leetcode]633. Sum of Square Numbers
- LeetCode 633. Sum of Square Numbers
- [Leetcode] 633. Sum of Square Numbers 解题报告
- LeetCode 633. Sum of Square Numbers
- leetcode 633. Sum of Square Numbers
- leetcode 633. Sum of Square Numbers
- leetcode 633. Sum of Square Numbers
- LeetCode 633. Sum of Square Numbers
- LeetCode 633. Sum of Square Numbers
- 【leetcode】633. Sum of Square Numbers(Python & C++)
- Leetcode 633. Sum of Square Numbers(Easy)
- leetcode 633. Sum of Square Numbers 二分查找+勾股定理
- 633. Sum of Square Numbers
- LeetCode 633. Sum of Square Numbers
- [LeetCode]633. Sum of Square Numbers
- 633. Sum of Square Numbers (数学)
- 633. Sum of Square Numbers
- 633. Sum of Square Numbers 平方数之和 看一个数是否能够有两个平方数组成
- 633. Sum of Square Numbers