357. Count Numbers with Unique Digits
2016-06-14 20:48
741 查看
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
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].
Analysis:
根据提示5的的公式直接做的。
Source Code(C++):
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].
Analysis:
根据提示5的的公式直接做的。
Source Code(C++):
#include <iostream> using namespace std; class Solution { public: int countNumbersWithUniqueDigits(int n) { if (n==0){ return 1; } int res = 10; int fk; for (int k=2; k<=n; k++) { fk=9; for(int i=9; i>=11-k; i--) fk *= i; res += fk; } return res; } }; int main() { Solution sol; cout << sol.countNumbersWithUniqueDigits(2); return 0; }
相关文章推荐
- css里面鼠标的形状-----》easyui哪点事
- 解决Hive installation issues: Hive metastore database is not initialized
- <LeetCode OJ> 334. Increasing Triplet Subsequence
- LeetCode---Top K Frequent Elements解题分析
- vuejs学习小记 单次插值
- Html中修改视频播放器的param属性的value的值
- String ,StringBuffer和StringBuilder最佳用法
- iOS-你真的会用UIMenuController吗?(详细)
- duilib动画按钮实现
- 如何使用iOS手势UIGestureRecognizer
- 关于UIImageView的显示问题——居中显示或者
- IOS UIScrollView
- HDOJ_Number Sequence
- Web自动化框架LazyUI使用手册(2)--先跑起来再说(第一个测试用例-百度搜索)
- Web自动化框架LazyUI使用手册(2)--先跑起来再说(第一个测试用例-百度搜索)
- java生成UUID通用唯一识别码 (Universally Unique Identifier)
- iOS开发 - 第02篇 - UI进阶 - 13 - 核心动画
- UIBezierPath详解
- UI设计师不可不知的安卓屏幕知识
- iOS最完美的UITextField中输入金额,只能输入数字和小数点,保留两位小数点且0放在首位