嗨,这是在 Adobe 面试中被问到的一个问题。
Numbers ending in 3 have at least one multiple having all ones.
for eg., 3 and 13 have amultiples like 111 and 111111 respectively. Given such
a no. , find the smallest such multiple of that number. The multiple can
exceed the range of int, long. You cannot use any complex data structure.
你能给我一个有效的解决方案吗