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 728 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 728 # by problem number
lcpy gen -s self_dividing_numbers # by problem name
128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.left and right, return a list of all the self-dividing numbers in the range [left, right] (both inclusive).
Input: left = 1, right = 22
Output: [1,2,3,4,5,6,7,8,9,11,12,15,22]
Input: left = 47, right = 85
Output: [48,55,66,77]
1 <= left <= right <= 10^4class Solution:
# Time: O((right - left + 1) * log10(right))
# Space: O(1) extra (output excluded)
def self_dividing_numbers(self, left: int, right: int) -> list[int]:
def is_self_dividing(num: int) -> bool:
remaining = num
while remaining > 0:
digit = remaining % 10
if digit == 0 or num % digit != 0:
return False
remaining //= 10
return True
return [num for num in range(left, right + 1) if is_self_dividing(num)]
| Time | Space |
|---|---|
| O((right - left + 1) * log10(right)) | O(1) extra (output excluded) |