Given a positive integer num, return true if num is a perfect square or false otherwise.
A perfect square is an integer that is the square of an integer. In other words, it is the product of some integer with itself.
You must not use any built-in library function, such as sqrt.
Example 1:
Input: num = 16
Output: true
Explanation: We return true because 4 * 4 = 16 and 4 is an integer.
Example 2:
Input: num = 14
Output: false
Explanation: We return false because 3.742 * 3.742 = 14 and 3.742 is not an integer.
Constraints:
- 1 <= num <= 231 - 1
class Solution:
def isPerfectSquare(self, num: int) -> bool:
return ( num**(1/2) == int(num**(1/2)))'알고리즘 문제 > Leetcode' 카테고리의 다른 글
| 206. Reverse Linked List (0) | 2022.12.28 |
|---|---|
| 74. Search a 2D Matrix (0) | 2022.12.28 |
| 441. Arranging Coins (0) | 2022.12.28 |
| 374. Guess Number Higher or Lower (0) | 2022.12.28 |
| 246. Strobogrammatic Number (0) | 2022.12.28 |