Description:
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]
)
解题思路:
通过概率来计算。考虑第一位是0与非0的情况。当为0,则只考虑个位数的情况,即0~9共10种。当为非0时,则是考虑9*9*8*7……*1的情况,也是动态规划的一种体现。
class Solution {
public:
int countNumbersWithUniqueDigits(int n) {
if(n==0) return 1;
if(n==1) return 10;
int res = 10, mid = 9;
for(int i = 2; i <= n; i++){
mid *= 9 - i + 2;
res += mid;
}
return res;
}
};