[leetcode] 357. Count Numbers with Unique Digits

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:

1. A direct way is to use the backtracking approach.
2. 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.
3. This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
4. Let f(k) = count of numbers with unique digits with length equals k.
5. f(1) = 10, ..., f(k) = 9 * 9 * 8 * ... (9 - k + 2) [The first factor is 9 because a number cannot start with 0].

这道题是统计所有位不重复的数字个数，题目难度为Medium。

题目比较简单，通过动态规划能够轻松解决，提示的回溯法思路过于复杂，就不尝试了，除非你想把所有满足条件的数字都罗列出来。

n等于0的情况只有数字0满足条件，特殊处理。最高位有9种可能（数字为0的情况已经特殊处理），因为最高位不能为0，次高位也有9中可能，因为次高位可以为0，之后的每一位都在前一位的基础上减少一种可能，这样通过递推即可得出n位数字满足条件的有几个，最终结果是1~n位满足条件的数字个数之和。具体代码：

class Solution {
public:
    int countNumbersWithUniqueDigits(int n) {
        if(!n) return 1;
        vector<int> cnt(n);
        cnt[0] = 9;
        for(int i=1; i<n; ++i) cnt[i] = cnt[i-1]*(10-i);
        return accumulate(cnt.begin(), cnt.end(), 1);
    }
};