leetcode---Valid Perfect Square

最新推荐文章于 2023-02-25 22:41:55 发布

谛听-

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量250

点赞数

分类专栏：题

本文链接：https://blog.csdn.net/u012319493/article/details/52305425

版权

题专栏收录该内容

456 篇文章 1 订阅

订阅专栏

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

class Solution {
public:
    bool isPerfectSquare(int num) 
    {
        if (num == 1) 
            return true;
        long x = num / 2;
        while (x * x > num) 
        {
            x /= 2;
        }
        for (int i = x; i <= 2 * x; ++i) 
        {
            if (i * i == num) 
                return true;
        }
        return false;
    }
};