LeetCode题目:357. Count Numbers with Unique Digits
来源:互联网 发布:在淘宝卖假货会坐牢吗 编辑:程序博客网 时间:2024/06/06 05:40
题目原址:点击打开链接
题目描述:
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]
)
题目很好理解,但是不好做啊!参考一位大神代码:
class Solution {public: int permutation(int n, int r) { if(r == 0) { return 1; }else{ return n * permutation(n - 1, r - 1); } } int countNumbersWithUniqueDigits(int n) { int sum = 1; if(n > 0) { int end = (n > 10)? 10 : n; for(int i = 0; i < end; i++) { sum += 9 * permutation(9, i); } } return sum; }};
阅读全文
0 0
- 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
- [leetcode] 357. Count Numbers with Unique Digits
- 357.[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 357. Count Numbers with Unique Digits
- 如何理解算法的正确性
- 结构体的对齐访问
- 智力题-猜牌问题
- 自定义的栈集合
- String
- LeetCode题目:357. Count Numbers with Unique Digits
- P1307 数字反转
- android developer tiny share-20170520
- 宋宝华的blog《Linux设备驱动开发详解》作者
- 小程序来测试加载的是哪个jar中的类
- 公约数和公倍数
- 【判断点在不在三角形内】FZU 2148 Moon Game
- 程序员常见面试题之快排、归并非递归算法
- 环境配置