Package g0401_0500.s0483_smallest_good_base

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    483 - Smallest Good Base.

    Hard

    Given an integer n represented as a string, return the smallest good base of n.

    We call k >= 2 a good base of n, if all digits of n base k are 1's.

    Example 1:

    Input: n = "13"

    Output: "3"

    Explanation: 13 base 3 is 111.

    Example 2:

    Input: n = "4681"

    Output: "8"

    Explanation: 4681 base 8 is 11111.

    Example 3:

    Input: n = "1000000000000000000"

    Output: "999999999999999999"

    Explanation: 1000000000000000000 base 999999999999999999 is 11.

    Constraints:

    • n is an integer in the range <code>3, 10<sup>18</sup></code>.

    • n does not contain any leading zeros.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String smallestGoodBase(String n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait