Skip to content

2269. Find the K-Beauty of a Number 👍

  • Time: $O(n)$
  • Space: $O(k)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
class Solution {
 public:
  int divisorSubstrings(int num, int k) {
    const string s = to_string(num);
    int ans = 0;

    for (int i = 0; i + k <= s.length(); ++i) {
      const int x = stoi(s.substr(i, k));
      if (x != 0 && num % x == 0)
        ++ans;
    }

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
class Solution {
  public int divisorSubstrings(int num, int k) {
    final String s = String.valueOf(num);
    int ans = 0;

    for (int i = 0; i + k <= s.length(); ++i) {
      final int x = Integer.parseInt(s.substring(i, i + k));
      if (x != 0 && num % x == 0)
        ++ans;
    }

    return ans;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution:
  def divisorSubstrings(self, num: int, k: int) -> int:
    s = str(num)
    ans = 0

    for i in range(len(s) - k + 1):
      x = int(s[i:i + k])
      if x != 0 and num % x == 0:
        ans += 1

    return ans