357. Count Numbers with Unique Digits (计算各位数字不都不相同的整数个数)
来源:互联网 发布:cf弹道优化 编辑:程序博客网 时间:2024/05/16 02:06
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].
题目大意:给定整数n,计算[0,10^n)范围内,各位数字都不相同的整数的个数。例如,123是各位数字都不相同的整数,而11,121就不是。
解题思路:
当n=0时,结果为1,即 {0};
当n=1时,即查找满足条件的一位数,结果为10,即 {0,1,2,3,4,5,6,7,8,9};
当n=2时,即查找满足条件的一位数和两位数,一位数的个数为10,满足条件的两位数即从1到9的某一个数字后面接一个不相同的数字,个数为9*9,那么结果为10+9*9;
当n=3时,即查找满足条件的一位数、两位数和三位数,一位数和两位数的个数为10+9*9,满足条件的三位数即上面求得的81个满足条件的两位数后面接一个不相同的数字,个数为9*9*8,那么结果为10+9*9+9*9*8;
……
当n>10以后,便找不到一个各位数字都不相同的数字了。
代码如下:(0ms,beats 12.25%)
public class Solution { public int countNumbersWithUniqueDigits(int n) { if (n == 0)return 1;int sum = 10;int add = 9;int i;for (i = 1; i < n; i++) {sum += add * (10 - i);add *= (10 - i);}return sum; }}
0 0
- 357. Count Numbers with Unique Digits (计算各位数字不都不相同的整数个数)
- 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
- 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
- 第008讲 多媒体标签汇总1
- Java将项目发布到github
- Java 在外部类中调用其它类的私有方法--反射(Reflection)
- 第13周项目4-Floyd算法的验证
- java.lang.NoSuchFieldError: INSTANCE in HttpClient when running hadoop
- 357. Count Numbers with Unique Digits (计算各位数字不都不相同的整数个数)
- SpringMVC源码分析(一)
- 静态方法与非静态方法
- webview获取网页标题并展示、自定义(重写)网页的alert弹框
- 微信公众平台实现获取用户OpenID的方法
- jsp的useBean作用域问题
- 关于java的一些问题,比较基础,大家可以看看咯
- 工程师们,不要想一辈子靠技术混饭吃(献给自己三个月后走出校门的自己)
- 【JZOJ4778】数列编辑器