题目:

题解:
class Solution {
public:
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;
}
};

![QT 与 C++实现基于[ TCP ]的聊天室界面](https://i-blog.csdnimg.cn/direct/09f879b1b195443f8f1ff0d41fbc5919.png)


![[数据集][目标检测]停车场空位检测数据集VOC+YOLO格式7959张2类别](https://i-blog.csdnimg.cn/direct/49e0c120e1e94065a40bc26f5cc50694.png)













