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
我们可以从c的平方根,注意即使c不是平方数,也会返回一个整型数。然后我们判断如果i*i等于c,说明c就是个平方数,只要再凑个0,就是两个平方数之和,返回true;如果不等于的话,那么算出差值c - i*i,如果这个差值也是平方数的话,返回true。遍历结束后返回false
class Solution {
public boolean judgeSquareSum(int c) {
for (int i = (int) Math.sqrt(c); i >= 0; i--) {
if (i * i == c) {
return true;
} else {
int t = c - i * i;
int d = (int) Math.sqrt(t);
if (d * d == t) {
return true;
}
}
}
return false;
}
}
这里用a和b代表了左右两个范围,分别为0和c的平方根,然后while循环遍历,如果a*a + b*b刚好等于c,那么返回true;如果小于c,则a增大1;反之如果大于c,则b自减1
class Solution {
public boolean judgeSquareSum(int c) {
int a = 0, b = (int) Math.sqrt(c);
while (a <= b) {
if (a * a + b * b == c) {
return true;
} else if (a * a + b * b < c) {
a++;
} else {
b--;
}
}
return false;
}
}