第十五周算法分析与设计：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])
Credits:
Special thanks to @memoryless for adding this problem and creating all test cases.
Subscribe to see which companies asked this question.

此题来自此处

---

解法思路：
以前大家都做到烂的经典排列组合问题~
我是这么想的：n=1时有10个，n=2时十位只能选9个、个位能选余下9个即 $9*9=81$ 个……以此类推，不过当n>10时肯定有某两个位置上肯定有重复，因为0~9已经分配光了。
下面上代码：

int countNumbersWithUniqueDigits(int n) {
        if(n <= 0) return 1;
        int result = 10;
        for(int i=2;i<=n && i<=10;i++) {
            result += 9 * calc(i-1);
        }
        return result;
    }
    int calc(int num) {
        int mltpy = 1;
        for(int i=1;i<=num;i++) {
            mltpy *= (9-i+1);
        }
        return mltpy;
    }

算法的时间复杂度为$O(n!)$，n是位数。
再看看backtracking解法是怎么解的去……