perfect_cube.py

defperfect_cube(n: int) ->bool:
"""
 Check if a number is a perfect cube or not.

 >>> perfect_cube(27)
 True
 >>> perfect_cube(4)
 False
 """
val=n** (1/3)
return (val*val*val) ==n


defperfect_cube_binary_search(n: int) ->bool:
"""
 Check if a number is a perfect cube or not using binary search.
 Time complexity : O(Log(n))
 Space complexity: O(1)

 >>> perfect_cube_binary_search(27)
 True
 >>> perfect_cube_binary_search(64)
 True
 >>> perfect_cube_binary_search(4)
 False
 >>> perfect_cube_binary_search("a")
 Traceback (most recent call last):
 ...
 TypeError: perfect_cube_binary_search() only accepts integers
 >>> perfect_cube_binary_search(0.1)
 Traceback (most recent call last):
 ...
 TypeError: perfect_cube_binary_search() only accepts integers
 """
ifnotisinstance(n, int):
raiseTypeError("perfect_cube_binary_search() only accepts integers")
ifn<0:
n=-n
left=0
right=n
whileleft<=right:
mid=left+ (right-left) //2
ifmid*mid*mid==n:
returnTrue
elifmid*mid*mid<n:
left=mid+1
else:
right=mid-1
returnFalse


if__name__=="__main__":
importdoctest

doctest.testmod()