#2269
Find the K-Beauty of a Number
pupil · 355 · lc easy +23 · verified · 63.1% accepted · 733 likes · top 65%
Description
The k-beauty of integer num is the count of length-k substrings of num (treated as a string) that are both nonzero and divisors of num.
Given num and k, return the k-beauty of num.
Note:
- Leading zeros within a substring are permitted.
- 0 cannot divide anything.
A substring is a contiguous sequence of characters.
Example 1:
Input: num = 240, k = 2
Output: 2
Explanation: The following are the substrings of num of length k:
- "24" from "240": 24 is a divisor of 240.
- "40" from "240": 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 "430043": 43 is a divisor of 430043.
- "30" from "430043": 30 is not a divisor of 430043.
- "00" from "430043": 0 is not a divisor of 430043.
- "04" from "430043": 4 is not a divisor of 430043.
- "43" from "430043": 43 is a divisor of 430043.
Therefore, the k-beauty is 2.
Code
1
2
3