leetcode 233. Number of Digit One
2017-07-10 22:51
363 查看
leetcode 233. Number of Digit One
问题分解: 分治进行计算的思想
public class Solution {
public int countDigitOne(int n) {
if(n<=0) return 0;
int r = 0;
for(long m=1;m<=n;m=m*10){
r += (n/m+8)/10*m + (n/m%10==1?n%m+1:0);
}
return r;
}
}
问题分解: 分治进行计算的思想
public class Solution {
public int countDigitOne(int n) {
if(n<=0) return 0;
int r = 0;
for(long m=1;m<=n;m=m*10){
r += (n/m+8)/10*m + (n/m%10==1?n%m+1:0);
}
return r;
}
}
相关文章推荐
- leetcode 233. Number of Digit One
- LeetCode 233. Number of Digit One
- 算法Week02.04 - LeetCode 233. Number of Digit One
- 【LeetCode】233. Number of Digit One
- [LeetCode]233. Number of Digit One
- leetcode 233. Number of Digit One 从1到n的数组中出现数字1的数量 + 寻找规律,公式计算
- leetcode233. Number of Digit One
- [Leetcode] 233. Number of Digit One 解题报告
- leetcode 233. Number of Digit One
- [leetcode]233. Number of Digit One
- leetcode hard模式专杀之233. Number of Digit One
- Leetcode 233. Number of Digit One
- Leetcode 233. Number of Digit One (Medium) (cpp)
- Leetcode 233. Number of Digit One
- 【LeetCode】233. Number of Digit One
- [leetcode] 233. Number of Digit One
- [leetcode] 233. Number of Digit One 解题报告
- leetcode No233. Number of Digit One
- leetcode 233. Number of Digit One
- [LeetCode]233. Number of Digit One