Package g1001_1100.s1015_smallest_integer_divisible_by_k

Class Solution

java.lang.Object
g1001_1100.s1015_smallest_integer_divisible_by_k.Solution
public class Solution extends java.lang.Object
1015 - Smallest Integer Divisible by K.

Medium

Given a positive integer k, you need to find the length of the smallest positive integer n such that n is divisible by k, and n only contains the digit 1.

Return the length of n. If there is no such n, return -1.

Note: n may not fit in a 64-bit signed integer.

Example 1:

Input: k = 1

Output: 1

Explanation: The smallest answer is n = 1, which has length 1.

Example 2:

Input: k = 2

Output: -1

Explanation: There is no such positive integer n divisible by 2.

Example 3:

Input: k = 3

Output: 3

Explanation: The smallest answer is n = 111, which has length 3.

Constraints:

  • 1 <= k <= 105

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    int
    smallestRepunitDivByK(int k)
     

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • smallestRepunitDivByK

      public int smallestRepunitDivByK(int k)