【leetcode】357. Count Numbers with Unique Digits【M】【72】

本文主要是介绍【leetcode】357. Count Numbers with Unique Digits【M】【72】，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

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:

1. A direct way is to use the backtracking approach.
2. 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.
3. This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
4. Let f(k) = count of numbers with unique digits with length equals k.
5. f(1) = 10, ..., f(k) = 9 * 9 * 8 * ... (9 - k + 2) [The first factor is 9 because a number cannot start with 0].

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

class Solution(object):def countNumbersWithUniqueDigits(self, n):if n == 0:return 1res = [10,81]for i in xrange(3,min(10,n)+1):j = 3t = 81while j <= i:t *= (9-j+2)j += 1res += t,#print resreturn sum(res[:min(n,10)])  

这篇关于【leetcode】357. Count Numbers with Unique Digits【M】【72】的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---