leetCode 483. Smallest Good Base

1.題目 For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1.java Now given a string representing n, you should return the smallest good base of n in string format.git The ran

>>阅读原文<<