Leetcode 233. Number of Digit One (Medium) (cpp)
来源:互联网 发布:全球主权财富基金知乎 编辑:程序博客网 时间:2024/05/18 17:58
Leetcode 233. Number of Digit One (Medium) (cpp)
Tag: Math
Difficulty: Medium
/*233. Number of Digit One (Medium)Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.For example:Given n = 13,Return 6, because digit 1 occurred in the following numbers: 1, 10, 11, 12, 13.Hint:Beware of overflow.*/class Solution {public:int countDigitOne(int n) {int res = 0;for (long long i = 1; i <= n; i *= 10) {res += (n / i + 8) / 10 * i + (n / i % 10 == 1) * (n % i + 1);}return res;}};
0 0
- Leetcode 233. Number of Digit One (Medium) (cpp)
- [Leetcode 233, Medium] Number of Digit One
- 【LeetCode】(233)Number of Digit One (Medium)
- Number of Digit One(Medium)
- leetcode 日经贴,Cpp code -Number of Digit One
- [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]233. Number of Digit One
- LeetCode 233. Number of Digit One
- leetcode.233. Number of Digit One
- LeetCode-233.Number of Digit One
- 233. Number of Digit One leetcode
- [LeetCode]233. Number of Digit One
- 【LeetCode】233. Number of Digit One
- Leetcode 233. Number of Digit One
- leetcode 233. Number of Digit One
- 4687. 【NOIP2016提高A组8.12】奇袭
- poj 3311 Hie with the Pie ,floyd + 枚举排列
- Android Init进程源码分析
- Java String 类型编码转换
- 【线段树】今天我种了一棵线段树
- Leetcode 233. Number of Digit One (Medium) (cpp)
- Redis集群方案
- Pro Android学习笔记(一四二):触摸屏(1):MotionEvents
- MySQL约束
- Ubuntu下hadoop1.21伪分布式搭建
- WebView设置
- jvm虚拟机内部原理之概述和内存分配
- 安全退出当前应用程序的方法_在新公司学到的第一点
- 文章标题