367. Valid Perfect Square

最新推荐文章于 2024-02-18 14:00:52 发布

zshouyi

最新推荐文章于 2024-02-18 14:00:52 发布

阅读量327

点赞数

分类专栏： LeetCode Binary Search Math 文章标签： LeetCode Binary Search Math Valid Perfect Square

本文链接：https://blog.csdn.net/zshouyi/article/details/68339885

版权

LeetCode 同时被 3 个专栏收录

402 篇文章 0 订阅

订阅专栏

Math

50 篇文章 0 订阅

订阅专栏

Binary Search

33 篇文章 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

Credits:
Special thanks to @elmirap for adding this problem and creating all test cases.

这道题不让用sqrt的函数，所以要自己写sqrt函数。参考 69. Sqrt(x)，返回最后的结果的平方等不等于num。代码如下：

public class Solution {
    public boolean isPerfectSquare(int num) {
        int start = 0, end = num / 2 + 2;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (mid < num / mid) {
                start = mid;
            } else {
                end = mid;
            }
        }
        return end * end == num;
    }
}