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 660 with 20 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 660 # by problem number
lcpy gen -s remove_9 # by problem name
1, remove any integer that contains 9 such as 9, 19, 29…
Now, you will have a new integer sequence [1, 2, 3, 4, 5, 6, 7, 8, 10, 11, ...].
Given an integer n, return the n^th (1-indexed) integer in the new sequence.
Input: n = 9
Output: 10
Input: n = 10
Output: 11
class Solution:
# Time: O(log n)
# Space: O(log n)
def new_integer(self, n: int) -> int:
result = 0
place = 1
while n > 0:
result += (n % 9) * place
place *= 10
n //= 9
return result
| Time | Space |
|---|---|
| O(log n) | O(log n) |