633. Sum of Square Numbers
Posted apanda009
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了633. Sum of Square Numbers相关的知识,希望对你有一定的参考价值。
Given a non-negative integer c, your task is to decide whether there‘re two integers a and b such that a2 + b2 = c. Example 1: Input: 5 Output: True Explanation: 1 * 1 + 2 * 2 = 5 Example 2: Input: 3 Output: False
public class Solution { public boolean judgeSquareSum(int c) { if (c < 0) { return false; } int left = 0, right = (int)Math.sqrt(c); while (left <= right) { int cur = left * left + right * right; if (cur < c) { left++; } else if (cur > c) { right--; } else { return true; } } return false; } }
以上是关于633. Sum of Square Numbers的主要内容,如果未能解决你的问题,请参考以下文章
[leetcode-633-Sum of Square Numbers]
LeetCode 633. Sum of Square Numbers