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 7 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 7 # by problem number
lcpy gen -s reverse_integer # by problem name
x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-2^31, 2^31 - 1], then return 0.
Assume the environment does not allow you to store 64-bit integers (signed or unsigned).
Input: x = 123
Output: 321
Input: x = -123
Output: -321
Input: x = 120
Output: 21
class Solution:
# Time: O(log(x))
# Space: O(1)
def reverse(self, x: int) -> int:
int_max = 2**31 - 1
result = 0
sign = 1 if x >= 0 else -1
x = abs(x)
while x != 0:
digit = x % 10
x //= 10
# Check for overflow before adding the digit
if result > (int_max - digit) // 10:
return 0
result = result * 10 + digit
return sign * result
| Time | Space |
|---|---|
| O(log(x)) | O(1) |