Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 69 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 69 # by problem number
lcpy gen -s sqrtx # by problem name
x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well.
You must not use any built-in exponent function or operator.
pow(x, 0.5) in c++ or x ** 0.5 in python.Input: x = 4
Output: 2
Input: x = 8
Output: 2
class Solution:
# Time: O(log x)
# Space: O(1)
def my_sqrt(self, x: int) -> int:
if x < 2:
return x
left = 0
right = x
while left < right:
mid = (left + right) // 2
if mid * mid <= x < (mid + 1) * (mid + 1):
return mid
elif mid * mid > x:
right = mid
else:
left = mid + 1
return left
| Time | Space |
|---|---|
| O(log x) | O(1) |