Solution of Valid Perfect Square

程序猿柴

于 2020-05-12 11:50:05 发布

阅读量174

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.csdn.net/qq_43337384/article/details/106073007

Leetcode 专栏收录该内容

32 篇文章

订阅专栏

本文介绍了一种不使用内置平方根函数判断一个数是否为完全平方数的方法。通过数学思路，利用奇数累加特性，逐步从1开始减去连续奇数，直到结果为0则返回真，否则返回假。时间复杂度为O(n)，空间复杂度为O(1)。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
Output: true

Example 2:

Input: 14
Output: false

Ideas of solution

It’s not hard to see that a perfect square can be obtained by adding an odd number.That means for example, 1 plus 3 plus 5 plus 7 is 16, which is a perfect square.So we just have to think about whether a perfect square can be completely subtracted from an odd number and get to 0.If you get something other than 0, false is returned. The time complexity is O(n), and the space complexity is O(1). The time consumption is 1.9Mb.

Code

func isPerfectSquare(num int) bool {
    num1 := 1
    for num > 0 {
        num -= num1
        num1 += 2
    }
    if num == 0 {
        return true
    }else{
        return false
    }
}

链接：https://leetcode-cn.com/problems/valid-perfect-square/solution/shu-xue-si-lu-by-lyai-bian-cheng/
来源：力扣（LeetCode）