Leetcode 357. Count Numbers with Unique Digits (Medium) (cpp)
来源:互联网 发布:java redis2.9 教程 编辑:程序博客网 时间:2024/06/02 11:37
Leetcode 357. Count Numbers with Unique Digits (Medium) (cpp)
Tag: Dynamic Programming, Backtracking, Math
Difficulty: Medium
/*357. Count Numbers with Unique Digits (Medium)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].*/class Solution {public: int countNumbersWithUniqueDigits(int n) { if (n < 1) return 1; int pre = 9, sum = 10; for (int i = 1; i < n; i++) { pre *= (10 - i); sum += pre; } return sum; }};
0 0
- Leetcode 357. Count Numbers with Unique Digits (Medium) (cpp)
- LeetCode解题报告 357. Count Numbers with Unique Digits [medium]
- (Leetcode)357. Count Numbers with Unique Digits (medium)
- Leetcode 357. Count Numbers with Unique Digits[medium]
- 357. Count Numbers with Unique Digits -Medium
- LeetCode #357 - Count Numbers with Unique Digits - Medium
- LeetCode #357 - Count Numbers with Unique Digits - Medium
- 【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 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.[LeetCode]Count Numbers with Unique Digits
- 放点自己的东西
- leetcode 26. Remove Duplicates from Sorted Array
- 动画插值器
- 关于DataGridView的使用
- new/delete 与 malloc/free的区别是什么?
- Leetcode 357. Count Numbers with Unique Digits (Medium) (cpp)
- Lua 自定义打印table函数
- Android开发——常见的内存泄漏以及解决方案(一)
- oc和h5交互
- Ubuntu下几种常用的文本编辑器
- C++ 变量和基本类型(二) const 限定符
- Android源码分析-全面理解Context
- iOS开发 UIToolBar的使用
- python中reduce()、map()、filter()的学习