LeetCode 357. Count Numbers with Unique Digits

LeetCode 357. Count Numbers with Unique Digits

原题链接：https://leetcode.com/problems/count-numbers-with-unique-digits/

简单题。总结出数学规律就好了。算n位数中有多少个数由unique digit构成。Count(n) = 9 *9 * 8 *...(11-n).

public class Solution {
    public int countNumbersWithUniqueDigits(int n) {
        if(n == 0){
            return 1;
        }
        if(n == 1){
            return 10;
        }
        if(n == 2){
            return 91;
        }
        int res = 91;
        int previous_one = 9*9;
        for(int i = 3; i <= n; i++){
            previous_one *= (11 - i);
            res += previous_one;
        }
        return res;
    }
}