LeetCode 367. Valid Perfect Square

最新推荐文章于 2022-04-16 10:00:50 发布

jmspan

最新推荐文章于 2022-04-16 10:00:50 发布

阅读量363

点赞数

分类专栏：二分法文章标签： leetcode

本文链接：https://blog.csdn.net/jmspan/article/details/51766284

版权

二分法专栏收录该内容

23 篇文章 0 订阅

订阅专栏

原题网址：https://leetcode.com/problems/valid-perfect-square/

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

方法：二分法。

public class Solution {
    public boolean isPerfectSquare(int num) {
        if (num < 0) return false;
        long i = 0;
        long j = num;
        while (i <= j) {
            long m = (i + j) / 2;
            long m2 = m * m;
            if (m2 == num) return true;
            if (m2 < num) i = m + 1; else j = m - 1;
        }
        return false;
    }
}