leetcode 357 Count Numbers with Unique Digits
2016-09-24 22:34
393 查看
问题描述:
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])
网友解答:
请点击:原文链接
Following the hint. Let f(n) = count of number with unique digits of length n.
f(1) = 10. (0, 1, 2, 3, …., 9)
f(2) = 9 * 9. Because for each number i from 1, …, 9, we can pick j to form a 2-digit number ij and there are 9 numbers that are different from i for j to choose from.
f(3) = f(2) * 8 = 9 * 9 * 8. Because for each number with unique digits of length 2, say ij, we can pick k to form a 3 digit number ijk and there are 8 numbers that are different from i and j for k to choose from.
Similarly f(4) = f(3) * 7 = 9 * 9 * 8 * 7….
…
f(10) = 9 * 9 * 8 * 7 * 6 * … * 1
f(11) = 0 = f(12) = f(13)….
any number with length > 10 couldn’t be unique digits number.
The problem is asking for numbers from 0 to 10^n. Hence return f(1) + f(2) + .. + f(n)
As @4acreg suggests, There are only 11 different ans. You can create a lookup table for it. This problem is O(1) in essence.
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])
网友解答:
请点击:原文链接
Following the hint. Let f(n) = count of number with unique digits of length n.
f(1) = 10. (0, 1, 2, 3, …., 9)
f(2) = 9 * 9. Because for each number i from 1, …, 9, we can pick j to form a 2-digit number ij and there are 9 numbers that are different from i for j to choose from.
f(3) = f(2) * 8 = 9 * 9 * 8. Because for each number with unique digits of length 2, say ij, we can pick k to form a 3 digit number ijk and there are 8 numbers that are different from i and j for k to choose from.
Similarly f(4) = f(3) * 7 = 9 * 9 * 8 * 7….
…
f(10) = 9 * 9 * 8 * 7 * 6 * … * 1
f(11) = 0 = f(12) = f(13)….
any number with length > 10 couldn’t be unique digits number.
The problem is asking for numbers from 0 to 10^n. Hence return f(1) + f(2) + .. + f(n)
As @4acreg suggests, There are only 11 different ans. You can create a lookup table for it. This problem is O(1) in essence.
public int countNumbersWithUniqueDigits(int n) { if (n == 0) return 1; int res = 10; int uniqueDigits = 9; int availableNumber = 9; while (n-- > 1 && availableNumber > 0) { uniqueDigits = uniqueDigits * availableNumber; res += uniqueDigits; availableNumber--; } return res; }
相关文章推荐
- [LeetCode] Remove Duplicates from Sorted List II
- LeetCode:Candy
- [Leetcode] Minimum Path Sum
- Leetcode: Rotate Image
- [Leetcode] Convert Sorted Array to Binary Search Tree
- Combination Sum(leetcode)
- LeetCode(55) Jump Game
- leetcode 题解 || Implement strStr() 问题 (即 KMP 算法实现)
- [leetcode] 66.Plus One
- LeetCode229 MajorityElementII java题解
- leetcode 137 —— Single Number II
- LeetCode——Convert Sorted Array to Binary Search Tree
- leetcode 刷题---Best Time to buy and sell stock
- leetcode之Lowest Common Ancestor of a Binary Search Tree
- [leetcode] 169. Majority Element
- leetcode——129——Sum Root to Leaf Numbers
- LeetCode Nim Game
- leetCode 204. Count Primes 哈希 求素数
- [LeetCode]--169. Majority Element
- Leetcode 27 Remove Element