357. Count Numbers with Unique Digits

最新推荐文章于 2020-06-05 12:35:22 发布

NodYoung

最新推荐文章于 2020-06-05 12:35:22 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/NNNNNNNNNNNNY/article/details/51674550

leetcode 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种计算在给定长度范围内所有具有唯一数字组合的数目的方法。使用了动态规划的方法来解决这个问题，并给出了C++实现代码。通过递推公式f(k)=9*9*8*…*(9-k+2)，可以有效地计算出特定长度内不包含重复数字的所有可能数字的数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.

Example:
Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x < 100, excluding [11,22,33,44,55,66,77,88,99])

Hint:

A direct way is to use the backtracking approach.
Backtracking should contains three states which are (the current number, number of steps to get that number and a bitmask which represent which number is marked as visited so far in the current number). Start with state (0,0,0) and count all valid number till we reach number of steps equals to 10n.
This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
Let f(k) = count of numbers with unique digits with length equals k.
f(1) = 10, …, f(k) = 9 * 9 * 8 * … (9 - k + 2) [The first factor is 9 because a number cannot start with 0].
Analysis:
根据提示5的的公式直接做的。
Source Code（C++）:

#include <iostream>
using namespace std;

class Solution {
public:
    int countNumbersWithUniqueDigits(int n) {
        if (n==0){
            return 1;
        }
        int res = 10;
        int fk;
        for (int k=2; k<=n; k++)
        {
            fk=9;
            for(int i=9; i>=11-k; i--)
                fk *= i;

            res += fk;          
        }
        return res;
    }
};

int main()
{
    Solution sol;
    cout << sol.countNumbersWithUniqueDigits(2);
    return 0;
}