LeetCode 357. Count Numbers with Unique Digits(计算无重复数字)
原题网址:https://leetcode.com/problems/count-numbers-with-unique-digits/
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.
Example:
Given n = 2, return 91. (
原创
2016-06-15 02:04:36 ·
1416 阅读 ·
0 评论