Class Solution

java.lang.Object
g0401_0500.s0483_smallest_good_base.Solution

public class Solution extends Object
483 - Smallest Good Base.<p>Hard</p> <p>Given an integer <code>n</code> represented as a string, return <em>the smallest <strong>good base</strong> of</em> <code>n</code>.</p> <p>We call <code>k >= 2</code> a <strong>good base</strong> of <code>n</code>, if all digits of <code>n</code> base <code>k</code> are <code>1</code>&rsquo;s.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> n = &ldquo;13&rdquo;</p> <p><strong>Output:</strong> &ldquo;3&rdquo;</p> <p><strong>Explanation:</strong> 13 base 3 is 111.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> n = &ldquo;4681&rdquo;</p> <p><strong>Output:</strong> &ldquo;8&rdquo;</p> <p><strong>Explanation:</strong> 4681 base 8 is 11111.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> n = &ldquo;1000000000000000000&rdquo;</p> <p><strong>Output:</strong> &ldquo;999999999999999999&rdquo;</p> <p><strong>Explanation:</strong> 1000000000000000000 base 999999999999999999 is 11.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>n</code> is an integer in the range <code>[3, 10<sup>18</sup>]</code>.</li> <li><code>n</code> does not contain any leading zeros.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • smallestGoodBase

      public String smallestGoodBase(String n)