[LC357]Count Numbers with Unique Digits

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].

题解

首先让我们明确 unique digits 的意思，这意味着一个数 num 的每一位都不存在重复。

所以整个题目变成一个非常简单的排列组合题，需要注意的只有一些边界条件。

例如 k = 3，所有每位不重复的结果就是 9 * 9 * 8 = 648
加上 k = 1时的10种不重复结果，和 k = 2 时的 91 种不重复结果，最后结果输出 739个 unique number.

public class Solution {
    public int countNumbersWithUniqueDigits(int n) {
        if(n<0){
            return 0; 
        }
        if(n == 0){
            return 1;
        }
        int sum = 10;
        int cnt = 1;
        int num = 9;
        while(cnt < n){
            num *= (9 -cnt +1);
            sum += num;
            cnt ++;
        }
        return sum;
    }
}