leetcode 357 c++. Count Numbers with Unique Digits
来源:互联网 发布:怎么注册国外域名 编辑:程序博客网 时间:2024/05/19 09:15
题目大意:
给出n,求0≤x≤10^n之间的每一位不重复数有多少个,排列组合思想,第一位有9种(0不能作为开头),第二位有9种,第三位有8种,以此类推
class Solution {public: int countNumbersWithUniqueDigits(int n) { if(n==0)return 1; if(n==1)return 10; int ans=10; int tem=9; for(int i=2;i<=n;i++){ tem=tem*(9-i+2); ans=ans+tem; } return ans; }};
0 0
- leetcode 357 c++. 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 题解(C++)
- 【LeetCode】357. Count Numbers with Unique Digits
- leetcode Count Numbers with Unique Digits
- LeetCode 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] Count Numbers with Unique Digits
- LeetCode Count Numbers with Unique Digits
- leetcode 357. Count Numbers with Unique Digits
- POJ 3145 线段树
- 深入理解JavaScript系列(4):立即调用的函数表达式
- 修改MySql密码
- Android API翻译之WebViewClient
- 用wamp5模拟一次AJAX请求
- leetcode 357 c++. Count Numbers with Unique Digits
- cf451e Devu and Flowers(容斥原理)
- mnesia锁数据时机
- java 语言中try catch的用处
- StringBuffer的用法
- 闭包
- Spring MVC 4 + Spring Security 4 + Hibernate +JPA实战
- vector 计算数组中的最大值 最小值
- Java学习重点易忽略问题整理