https://leetcode-cn.com/problems/valid-perfect-square/
给定一个正整数 num,编写一个函数,如果 num 是一个完全平方数,则返回 True,否则返回 False。
class Solution {
public boolean isPerfectSquare(int num) {
int low=0, high=num;
while(low<=high) {
int mid = low + (high - low) / 2;
// int mid = (low+high)/2; //内存消耗稍微大些
if(mid==num*1.0/mid) {
return true;
}else if(mid>num*1.0/mid) {
high = mid-1;
}else {
low=mid+1;
}
}
return false;
}
}