题目链接:https://leetcode.com/problems/valid-perfect-square/
题目:
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
思路:
用long代替int。。。因为有case会溢出。
算法:
public boolean isPerfectSquare(int x) {
long left = 1, right = x;
while (left <= right) {
long mid = left + (right - left) / 2;
if (mid * mid == x) {
return true;
} else if (mid * mid < x) {
left = mid + 1;
} else {
right = mid - 1;
}
}
return false;
}