LeetCode 633. Sum of Square Numbers
2018-03-15 16:00
375 查看
public boolean judgeSquareSum(int c) { int left = 0, right = (int) Math.sqrt(c); while(left <= right) { int sum = left * left + right * right; if(sum < c) { left++; } else if(sum > c) { right--; } else { return true; } } return false; }本题采用滑动窗口的方法。
相关文章推荐
- 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
- [Leetcode] 633. Sum of Square Numbers 解题报告
- [leetcode]633. Sum of Square Numbers
- Leetcode 633. Sum of Square Numbers(Easy)
- LeetCode 633. Sum of Square Numbers
- 633. Sum of Square Numbers
- 633. Sum of Square Numbers
- LeetCode 633. Sum of Square Number
- 633. Sum of Square Numbers
- 2017.12.25 LeetCode 633. Sum of Square Numbers【思维枚举】
- 633. Sum of Square Numbers。
- 633. Sum of Square Numbers标题