• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g1001_1100.s1015_smallest_integer_divisible_by_k.readme.md Maven / Gradle / Ivy

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