LeetCode 367. Valid Perfect Square

最新推荐文章于 2017-05-06 22:00:17 发布

David_DLUT

最新推荐文章于 2017-05-06 22:00:17 发布

阅读量224

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/David_DLUT/article/details/53941631

版权

LeetCode 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

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) {
        int left = 1, right = num;
        while (left <= right) {
            long mid = (left + right) / 2;
            long square = mid * mid;
            if (square == num) {
                return true;
            }
            else if (square < num) {
                left = mid + 1;
            }
            else {
                right = mid - 1;
            }
        }
        return false;
    }
};