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
这个题不能用开方,应该要想到用二分法。
还有需要注意的地方就是越界问题了。如果left=1,right=Integer.MAX_VALUE,(left+right)/2是负数,还要小心mid*mid要小与Integer.MAX_VALUE。
public class Solution {
public boolean isPerfectSquare(int num) {
if(num==Integer.MAX_VALUE)
return false;
return binarySearch(1, num, num);
}
public boolean binarySearch(int left,int right,int val){
if(left>right||left<=0||right<=0)
return false;
int mid=(left+right)/2;
if(mid>46340){
return binarySearch(left, mid-1, val);
}
if(mid*mid==val)
return true;
if(mid*mid<val){
return binarySearch(mid+1, right, val);
}
if(mid*mid>val){
return binarySearch(left, mid-1, val);
}
return true;
}
}