2021年2月3日
[LeetCode] 1015. Smallest Integer Divisible by K 可以整除K的最小整数
摘要： Given a positive integer , you need to find the length of the smallest positive integer such that is divisible by , and only contains the digit . Retu 阅读全文
posted @ 2021-02-03 16:48 Grandyang 阅读(596) 评论(3) 推荐(0) 编辑
Fork me on GitHub