题目:
题解:
class Solution:def lexicalOrder(self, n: int) -> List[int]:ans = [0] * nnum = 1for i in range(n):ans[i] = numif num * 10 <= n:num *= 10else:while num % 10 == 9 or num + 1 > n:num //= 10num += 1return ans
题目:
题解:
class Solution:def lexicalOrder(self, n: int) -> List[int]:ans = [0] * nnum = 1for i in range(n):ans[i] = numif num * 10 <= n:num *= 10else:while num % 10 == 9 or num + 1 > n:num //= 10num += 1return ans
本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.rhkb.cn/news/413677.html
如若内容造成侵权/违法违规/事实不符,请联系长河编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!