We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent bc28930 commit 8b417b3Copy full SHA for 8b417b3
maths/perfect_cube.py
@@ -10,6 +10,7 @@ def perfect_cube(n: int) -> bool:
10
val = n ** (1 / 3)
11
return (val * val * val) == n
12
13
+
14
def perfect_cube_binary_search(n: int) -> bool:
15
"""
16
Check if a number is a perfect cube or not using binary search.
@@ -31,14 +32,15 @@ def perfect_cube_binary_search(n: int) -> bool:
31
32
right = n
33
while left <= right:
34
mid = left + (right - left) // 2
- if mid*mid*mid == n:
35
+ if mid * mid * mid == n:
36
return True
- elif mid*mid*mid < n:
37
+ elif mid * mid * mid < n:
38
left = mid + 1
39
else:
40
right = mid - 1
41
return False
42
43
44
if __name__ == "__main__":
45
import doctest
46
0 commit comments