[LeetCode By Go 89]367. Valid Pe

作者: miltonsun | 来源:发表于2017-09-05 10:06 被阅读5次

[LeetCode By Go 89]367. Valid Pe
LeetCode 367. Valid Perfect Squa
2019-06-13
(18/39) Binary Search 38道题
Leetcode-367 有效的完全平方数
Binary Search(Easy)
[LeetCode][Python]367. Valid Per
Leetcode 367. Valid Perfect Squa
LeetCode #125 #680 #9 #234 2018-
LeetCode #242 #538 #796 #349 #35

题目

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

解题思路

从1~num中找平方等于num的值i，找到返回true
如果i²大于num，说明num不是平方数，返回false

代码

func isPerfectSquare(num int) bool {
    
    for i := 1; i <= num; i++ {
        if num == i * i {
            return true 
        } else if num < i * i {
            return false 
        }
    } 
    
    return false 
}

网友评论

LeetCode By Go

本文标题：[LeetCode By Go 89]367. Valid Pe

本文链接：https://www.haomeiwen.com/subject/tkcujxtx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

[LeetCode By Go 89]367. Valid Pe

题目

解题思路

代码

相关文章

[LeetCode By Go 89]367. Valid Pe

LeetCode 367. Valid Perfect Squa

2019-06-13

(18/39) Binary Search 38道题

Leetcode-367 有效的完全平方数

Binary Search(Easy)

[LeetCode][Python]367. Valid Per

Leetcode 367. Valid Perfect Squa

LeetCode #125 #680 #9 #234 2018-

LeetCode #242 #538 #796 #349 #35

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读

LeetCode By Go