Leetcode - Square
367. Valid Perfect Square[E]
https://leetcode.com/problems/valid-perfect-square/
Description
Given a positive integer num, write a function which returns True if num is a perfect square else False.
Follow up: Do not use any built-in library function such as sqrt.
Example 1:
1 | Input: num = 16 |
Example 2:
1 | Input: num = 14 |
Constraints:
1 <= num <= 2^31 - 1
Solution
1 |
All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.
Comment





