357. Count Numbers with Unique Digits
来源:互联网 发布:自动化软件系统工程师 编辑:程序博客网 时间:2024/06/07 16:41
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].
Credits:
Special thanks to @memoryless for adding this problem and creating all test cases.
public class Solution { public int countNumbersWithUniqueDigits(int n) { if (n < 1) { return 1; } int result = 10; int count = 9; for (int i = 1; i < n; i ++) { count *= (10 - i); result += count; } return result; }}
0 0
- 【LeetCode】357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- LeetCode 357. Count Numbers with Unique Digits
- [leetcode] 357. Count Numbers with Unique Digits
- 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
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- 357. Count Numbers with Unique Digits
- LeetCode:357. Count Numbers with Unique Digits
- 数据链路层
- web前端编程规范
- Maven入门指南① :Maven 快速入门及简单使用
- Docker版本升级至17.03
- Unity3D说明文档翻译-Introduction to Components
- 357. Count Numbers with Unique Digits
- MAVEN创建多模块项目(水平与树形结构)
- JAVA并发编程-线程间协作(Object监视器方法与Condition)
- Maven较完整教程
- Hibernate学习之三(一对一关联)
- Hadoop集群完全分布式搭建教程-CentOS
- MySQL修改root密码的多种方法
- Hadoop单机模式和伪分布式搭建教程CentOS
- 单独使用ActiveSupport的助记