bool isPerfectSquare(int num){
long long j=num, i=1;
long long mid;
while(i<j){
mid = i+(j-i)/2;
if(mid*mid > num){
j = mid-1;
}else if(mid*mid < num) {
i = mid+1;
}else {
printf("mid %d \n", mid);
return true;
}
}
return i*i == num;
}
leetcode-367-有效的完全平方数-C语言
最新推荐文章于 2022-05-05 09:50:06 发布