题目：
题解：
class Solution:def getSteps(self, cur: int, n: int) -> int:steps, first, last = 0, cur, curwhile first <= n:steps += min(last, n) - first + 1first *= 10last = last * 10 + 9return stepsdef findKthNumber(self, n: int, k: int) -> int:cur = 1k -= 1while k:steps = self.getSteps(cur, n)if steps <= k:k -= stepscur += 1else:cur *= 10k -= 1return cur
