算法二分查找

有效的完全平方数

2025-10-06  本文已影响0人  何以解君愁

有效的完全平方数


class Solution {
    public boolean isPerfectSquare(int num) {
        int left = 0,right = num;
        while(left <= right){
            int mid = left + (right - left) / 2;
            long square = (long) mid * mid;
            if(square == num){
                return true;
            }else if(square > num){
                right = mid - 1;
            }else{
                left = mid + 1;
            }
        }
        return false;
    }
}
上一篇 下一篇

猜你喜欢

热点阅读