Leetcode simple question: find the K beauty value of a number

subject

An integer num Of k The beauty value is defined as num The following conditions are met in Substring number ：

Substring length is k .
Substrings can be divided by num .
Give you an integer num and k , Please return num Of k Beauty is worth .

Be careful ：

Allow Prefix 0 .
0 You can't divide any value .
One Substring Is a sequence of consecutive characters in a string .

Example 1：

Input ：num = 240, k = 2
Output ：2
explain ： Here are num The inner length is k Substring of ：

• “240” Medium “24” ：24 aliquot 240 .
• “240” Medium “40” ：40 aliquot 240 .
  therefore ,k The beauty value is 2 .
  Example 2：

Input ：num = 430043, k = 2
Output ：2
explain ： Here are num The inner length is k Substring of ：

• “430043” Medium “43” ：43 aliquot 430043 .
• “430043” Medium “30” ：30 Not divisible 430043 .
• “430043” Medium “00” ：0 Not divisible 430043 .
• “430043” Medium “04” ：4 Not divisible 430043 .
• “430043” Medium “43” ：43 aliquot 430043 .
  therefore ,k The beauty value is 2 .

Tips ：

1 <= num <= 10^9
1 <= k <= num.length （ take num As a string ）

source ： Power button （LeetCode）

Their thinking

   The simple way is , Will be given num It is transformed into a string and then traversed to determine whether each substring meets the conditions . Here we need to pay attention to dividing by 0 To deal with .

class Solution:
    def divisorSubstrings(self, num: int, k: int) -> int:
        n,count=str(num),0
        for i in range(0,len(n)-k+1):
            try:
                if not num%int(n[i:i+k]):
                    count+=1
            except:
                pass
        return count