文章作者：Tyan
博客：noahsnail.com | CSDN | 简书
Count Numbers with Unique Digits
class Solution {
public:
int countNumbersWithUniqueDigits(int n) {
int total = 1;
for(int i = 0; i < n; i++) {
int count = 9;
for(int j = 1; j <= i; j++) {
count *= (10 - j);
}
total += count;
}
return total;
}
};
文章作者：Tyan博客：noahsnail.com | CSDN | 简书 1. Description 2. S...
题目描述： 357. Count Numbers with Unique Digits Given a non-n...
Given a non-negative integer n, count all numbers with un...
这道题的意思呢，是给我们一个整数n，算出大于等于0小于10的n次方的数中各位上不相同的数字的个数，说起来有些...
题目要求：Given a non-negative integer n, count all numbers wi...
问题： Given a non-negative integer n, count all numbers wit...
357. Count Numbers with Unique Digits 我写的代码真是没啥美感，来份大佬的看下吧。
https://leetcode.com/problems/count-numbers-with-unique-d...
题目： https://leetcode.com/problems/count-numbers-with-uniq...
LeetCode 315. Count of Smaller Numbers After Self Descrip...
本文标题：Leetcode 357. Count Numbers with
本文链接：https://www.haomeiwen.com/subject/fvzgzftx.html
网友评论