forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_633.java
38 lines (35 loc) · 901 Bytes
/
_633.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
package com.fishercoder.solutions;
/**
* 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 _633 {
public static class Solution1 {
public boolean judgeSquareSum(int c) {
if (c < 0) {
return false;
}
int left = 0;
int right = (int) (Math.sqrt(c));
while (left <= right) {
int curr = left * left + right * right;
if (curr > c) {
right--;
} else if (curr < c) {
left++;
} else {
return true;
}
}
return false;
}
}
}