Time: 866 ms (93.65%) | Memory: 18.9 MB (98.41%) - LeetSync

Author: YegonGodwin

3548-find-the-count-of-good-integers/find-the-count-of-good-integers.py

@@ -0,0 +1,28 @@
+class Solution:
+    def countGoodIntegers(self, n: int, k: int) -> int:
+        dictionary = set()
+        base = 10 ** ((n - 1) // 2)
+        skip = n & 1
+        # Enumerate the number of palindrome numbers of n digits
+        for i in range(base, base * 10):
+            s = str(i)
+            s += s[::-1][skip:]
+            palindromicInteger = int(s)
+            # If the current palindrome number is a k-palindromic integer
+            if palindromicInteger % k == 0:
+                sorted_s = "".join(sorted(s))
+                dictionary.add(sorted_s)
+
+        fac = [factorial(i) for i in range(n + 1)]
+        ans = 0
+        for s in dictionary:
+            cnt = [0] * 10
+            for c in s:
+                cnt[int(c)] += 1
+            # Calculate permutations and combinations
+            tot = (n - cnt[0]) * fac[n - 1]
+            for x in cnt:
+                tot //= fac[x]
+            ans += tot
+
+        return ans