357 Count Numbers with Unique Digits

1 题目

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

2 尝试解

2.1 分析

对于N位数，数字不重复的情况有9*9*8*7*...*(9-k+2)种，对于0~10^N，只需要将这些结果累加即可。

2.2 代码

class Solution {
public:
    int countNumbersWithUniqueDigits(int n) {
        if(n == 0) return 1;
        int result = 10;
        int multiple = 9;
        for(int i = 0; i < n - 1 ; i++){
            multiple *= (9-i);
            result += multiple;        
        }
        return result;
    }
};

3 标准解

class Solution {
public:
    int permutation(int n, int r)
    {
        if(r == 0)
        {
            return 1;
        }else{
            return n * permutation(n - 1, r - 1);
        }
    }
    int countNumbersWithUniqueDigits(int n) {
        int sum = 1;
        if(n > 0)
        {
           int end = (n > 10)? 10 : n;
           for(int i = 0; i < end; i++)
           {
               sum += 9 * permutation(9, i);
           }
        }
        return sum;
    }
};