LeetCode 0357 - Count Numbers with Unique Digits
Count Numbers with Unique Digits
Desicription
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.
Example:
1 | Input: 2 |
Solution
1 | class Solution { |
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.
Example:
1 | Input: 2 |
1 | class Solution { |