[LeetCode] Count Numbers with Unique Digits
来源:互联网 发布:游族网络股份有限公司 编辑:程序博客网 时间:2024/05/17 18:13
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:
- A direct way is to use the backtracking approach.
- 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.
- This problem can also be solved using a dynamic programming approach and some knowledge of combinatorics.
- Let f(k) = count of numbers with unique digits with length equals k.
- f(1) = 10, …, f(k) = 9 * 9 * 8 * … (9 - k + 2) [The first factor is 9 because a number cannot start with 0].
解题思路
按提示中的公式计算。
实现代码
// Runtime: 0 mspublic class Solution { public int countNumbersWithUniqueDigits(int n) { if (n == 0) { return 1; } int total = 10; int cnt = 9; for (int i = 2; i <= n; i++) { cnt *= 11 - i; total += cnt; } return total; }}
0 0
- 【LeetCode】357. Count Numbers with Unique Digits
- leetcode Count Numbers with Unique Digits
- LeetCode 357. Count Numbers with Unique Digits
- LeetCode:Count Numbers with Unique Digits
- [leetcode] 357. Count Numbers with Unique Digits
- 【LeetCode】357. Count Numbers with Unique Digits
- [LeetCode] Count Numbers with Unique Digits
- LeetCode Count Numbers with Unique Digits
- leetcode 357. Count Numbers with Unique Digits
- leetcode 357. Count Numbers with Unique Digits
- leetcode.357. Count Numbers with Unique Digits
- LeetCode 357 Count Numbers with Unique Digits
- 【Leetcode】Count Numbers with Unique Digits
- LeetCode[357] Count Numbers with Unique Digits
- LeetCode:357. Count Numbers with Unique Digits
- 【leetcode】357. Count Numbers with Unique Digits
- LeetCode 357 Count Numbers with Unique Digits
- [leetcode] 357. Count Numbers with Unique Digits
- Leetcode Add two numbers链表相加
- linux g_webcam.ko问题(续)
- Java 计数器Counter(一个FileReader ,FileWriter的例子)
- Android学习笔记之图像颜色处理(ColorMatrix)
- linux g_webcam.ko问题(续二) —— 在友善210上的限制
- [LeetCode] Count Numbers with Unique Digits
- 今天起决定写一个开源的建筑结构分析软件
- Reactor模式
- centos开启ssh连接
- 虹
- UI控件之编辑文本控件EditText
- Sublime Text 2 设置文件详解
- 关于FPGA驱动TFT屏渐变显示出现条纹的问题解决
- 80道常见数据结构面试题及其解法