题目:
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])
这题没什么好说的,排列组合。
唯一注意就是n=0输出1。
class Solution {
public:
int countNumbersWithUniqueDigits(int n) {
int rt = 0;
if (n == 0) return 1;
if (n > 10) n = 10;
if (n >= 1) rt = 10;
while (n > 1) {
int ans = 0;
int ans1 = 1;
for (int i = 9; i >= 9 - n + 1; i--) ans1 *= i;
ans += ans1;
ans1 = n - 1;
for (int i = 9; i >= 9 - n + 2; i--) ans1 *= i;
ans += ans1;
rt += ans;
n--;
}
return rt;
}
};