Given a positive integer num, write a function which returns True if num is a perfect square else False.
Note: Do not use any built-in library function such as sqrt
.
Example 1:
Input: 16 Returns: True
Example 2:
Input: 14 Returns: False
Credits:
Special thanks to @elmirap for adding this problem and creating all test cases.
public class Solution {
public boolean isPerfectSquare(int num) {
int start = 0, end = num / 2 + 2;
while (start + 1 < end) {
int mid = start + (end - start) / 2;
if (mid < num / mid) {
start = mid;
} else {
end = mid;
}
}
return end * end == num;
}
}