Package g2201_2300.s2269_find_the_k_beauty_of_a_number

Class Solution

java.lang.Object

g2201_2300.s2269_find_the_k_beauty_of_a_number.Solution

public class Solution
extends Object

2269 - Find the K-Beauty of a Number\. Easy The **k-beauty** of an integer `num` is defined as the number of **substrings** of `num` when it is read as a string that meet the following conditions: * It has a length of `k`. * It is a divisor of `num`. Given integers `num` and `k`, return _the k-beauty of_ `num`. Note: * **Leading zeros** are allowed. * `0` is not a divisor of any value. A **substring** is a contiguous sequence of characters in a string. **Example 1:** **Input:** num = 240, k = 2 **Output:** 2 **Explanation:** The following are the substrings of num of length k: - "24" from "**24**0": 24 is a divisor of 240. - "40" from "2**40**": 40 is a divisor of 240. Therefore, the k-beauty is 2. **Example 2:** **Input:** num = 430043, k = 2 **Output:** 2 **Explanation:** The following are the substrings of num of length k: - "43" from "**43**0043": 43 is a divisor of 430043. - "30" from "4**30**043": 30 is not a divisor of 430043. - "00" from "43**00**43": 0 is not a divisor of 430043. - "04" from "430**04**3": 4 is not a divisor of 430043. - "43" from "4300**43**": 43 is a divisor of 430043. Therefore, the k-beauty is 2. **Constraints:** * 1 <= num <= 109 * `1 <= k <= num.length` (taking `num` as a string)

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	divisorSubstrings(int num, 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

divisorSubstrings

public int divisorSubstrings(int num,
 int k)