原文:[LeetCode] 1015. Smallest Integer Divisible by K 可以整除K的最小整数

Given a positive integerK, you need to find thelengthof thesmallestpositive integerNsuch thatNis divisible byK, andNonly contains the digit . Return thelengthof N. If there is no suchN, return . Note ...

2021-02-03 16:48 3 243 推荐指数:

查看详情

 
粤ICP备18138465号  © 2018-2025 CODEPRJ.COM