题目:

题解:
int countNumbersWithUniqueDigits(int n) {
if (n == 0) {
return 1;
}
if (n == 1) {
return 10;
}
int ans = 10, cur = 9;
for (int i = 0; i < n - 1; ++i) {
cur *= 9 - i;
ans += cur;
}
return ans;
}









![[CTF]-Reverse:纯逻辑分析题型综合解析](https://i-blog.csdnimg.cn/blog_migrate/cbfc05cef5495941c5f66f1fc666428d.png)









