LeetCode 357. Count Numbers with Unique Digits

357. Count Numbers with Unique Digits
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])

Hint:

A direct way is to use the backtracking approach.
Backtracking should contains three states which are (the current number, number of steps to get that number and a bitmask which represent which number is marked as visited so far in the current number). Start with state (0,0,0) and count all valid number till we reach number of steps equals to 10n.
This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
Let f(k) = count of numbers with unique digits with length equals k.
f(1) = 10, ..., f(k) = 9 * 9 * 8 * ... (9 - k + 2) [The first factor is 9 because a number cannot start with 0].

题目大意：给一个数n，求0～n位数间所有数字中，每一位数字都各不相同的数字的个数～
分析：根据提示中所给的公式，1位数字有10个，第k位有f(k) = 9 * 9 * 8 * ... (9 - k + 2)个，累加从2位到n位的f(k)的总和，再加上1位的10个数字，即为所求～

class Solution {
public:int countNumbersWithUniqueDigits(int n) {if(n == 0) return 1;int result = 10, cnt = 9;for(int i = 2; i <= n; i++) {cnt *= (11 - i);result += cnt;}return result;}
};

LeetCode 357. Count Numbers with Unique Digits相关推荐

leetcode -- 357. Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Examp ...
leetcode 357. Count Numbers with Unique Digits | 357. 计算各个位数不同的数字个数（Java）
题目 https://leetcode.com/problems/count-numbers-with-unique-digits/ 题解只要认真分析数字特点,这题不难,就是个带一些条件的排列组合. ...
357. Count Numbers with Unique Digits
357. Count Numbers with Unique Digits Given a non-negative integer n, count all numbers with unique ...
[LeetCode] Count Numbers with Unique Digits 计算各位不相同的数字个数
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Examp ...
LeetCode Count Numbers with Unique Digits(计数问题)
题意:给出一个整数,求在[0,10^n]之间各位数字不相同的数的个数思路:n为1时,有10个 n为2时, 十位数只能是1-9,而个数位可以为0,所以也是有9种选择 n为3时,百位数有9种选择,十位数 ...
mysql unique count_MySQL - Count Number of Unique Values
问题 If I have three columns: orderNumber, name, email and I would like to count how many unique email ...
pandas使用nunique函数计算dataframe每个数据列的独特值的个数（count number of unique values in each column of dataframe）
pandas使用nunique函数计算dataframe每个数据列的独特值的个数(count number of unique values in each column of dataframe) ...
LeetCode 829. Consecutive Numbers Sum--笔试题--C++解法
LeetCode 829. Consecutive Numbers Sum–笔试题–C++解法 LeetCode题解专栏:LeetCode题解 LeetCode 所有题目总结:LeetCode 所有题 ...
LeetCode 38. Count and Say
问题链接 LeetCode 38. Count and Say 题目解析找规律,每一个数字串是上一个数字串的"读法".比如:n=1时为"1",读作" ...

LeetCode 357. Count Numbers with Unique Digits

LeetCode 357. Count Numbers with Unique Digits相关推荐

最新文章

热门文章