LeetCode 357. Count Numbers with Unique Digits

357. Count Numbers with Unique Digits

Medium

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

Example:

Input: 2
Output: 91
Explanation: The answer should be the total numbers in the range of 0 ≤ x < 100,
excluding 11,22,33,44,55,66,77,88,99

题意

给定n，计算[0, 10^n)之间所有数字都不相同的整数个数f(n)

思路

数学题。
$$f(n)=A_9^n+n\times A_9^{n-1}+(n-1)\times A_9^{n-2}+(n-2)\times A_9^{n-3}+...+2\times A_9^1+A_9^0,0\le n\le 9$$
$$f(n)=10\times A_9^9+9\times A_9^8+8\times A_9^7+...+2\times A_9^1+A_9^0,n\ge 10$$

代码

class Solution {
    public int countNumbersWithUniqueDigits(int n) {
        if (n == 0) {
            return 1;
        }
        if (n > 10) {
            n = 10;
        }
        int[] a = new int[n == 10? 10: n + 1];
        int i = 0, len = a.length;
        a[0] = 1;
        a[1] = 9;
        for (i=2; i<len; ++i) {
            a[i] = (10 - i) * a[i - 1];
        }
        int ans = n == 10? 0: a[n];
        for (i=n-1; i>=0; --i) {
            ans += (i + 1) * a[i];
        }
        return ans;
    }
}