题目
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/b0f81a7fec31f174a3e1a9fc75090f82.png)
Leetcode 367. 有效的完全平方数
代码(7.19 首刷自解)
class Solution {
public:
bool isPerfectSquare(int num) {
int l = 1, r = num;
while(l <= r) {
long mid = (r-l)/2+l;
if(num < mid*mid) {
r = mid-1;
} else if(num > mid*mid) {
l = mid+1;
}else {
return true;
}
}
return false;
}
};