Categorygithub.com/frankegoesdown/leetcode-in-goAlgorithms0357.count-numbers-with-unique-digits
package
0.0.0-20190725034537-db5e768ce8c3
Repository: https://github.com/frankegoesdown/leetcode-in-go.git
Documentation: pkg.go.dev
Overview
Versions
1
Dependencies
0
Dependents
0
Files
7 SLOC

# README

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])

Credits:Special thanks to @memoryless for adding this problem and creating all test cases.

解题思路

见程序注释