数论-组合 LeetCode-3272. 统计好整数的数目 2382分

黄昏月亮很忙

已于 2024-10-10 10:09:24 修改

阅读量57

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

于 2024-10-10 10:08:41 首次发布

本文链接：https://blog.csdn.net/2402_84970476/article/details/142814089

版权

LeetCode 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

class Solution:
    def countGoodIntegers(self, n: int, k: int) -> int:
        @cache
        def fac(x):
            return math.factorial(x)

        half_len = (n + 1) // 2
        palindromes = set()
        for num in range(10 ** (half_len - 1), 10 ** half_len):
            pal_str = str(num) + str(num)[:n - len(str(num))][::-1]
            if int(pal_str) % k == 0:
                palindromes.add(tuple(sorted(Counter(pal_str).items())))

        total = 0
        for counts in palindromes:
            combinations = fac(n)
            for _, count in counts:
                combinations //= fac(count)

            if counts[0][0] == '0':
                wrong_comb = fac(n - 1)
                wrong_comb //= fac(counts[0][1] - 1)
                for _, count in counts[1:]:
                    wrong_comb //= fac(count)
                combinations -= wrong_comb

            total += combinations
        
        return total