LeetCode 258. Add Digits
来源:互联网 发布:树莓派3安装ubuntu 编辑:程序博客网 时间:2024/06/06 02:32
258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
For example:
Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.
Follow up:
Could you do it without any loop/recursion in O(1) runtime?
class Solution {public: int addDigits(int num) { return num - (num - 1) / 9 * 9; }};
0 0
- 【LeetCode】258.Add Digits
- LeetCode 258. Add Digits
- LeetCode : 258. Add Digits
- leetCode 258. Add Digits
- LeetCode 258. Add Digits
- 258. Add Digits LeetCode
- LeetCode 258. Add Digits
- LeetCode 258. Add Digits
- leetcode 258. Add Digits
- [LeetCode]258. Add Digits
- LeetCode 258. Add Digits
- <LeetCode>258. Add Digits
- leetcode--258. Add Digits
- LeetCode 258. Add Digits
- LeetCode *** 258. Add Digits
- Leetcode 258. Add Digits
- 258.[LeetCode]Add Digits
- 【leetcode】258. Add Digits
- Linux 精通Linux的“kill”命令
- Linux 文件编程—fopen函数
- E:before E:after 插入图像
- 如何有效管理自己的时间
- 从决策树到随机森林--小结
- LeetCode 258. Add Digits
- nsSkinEngine制作Windows安装包
- leetcode 11 - Container With Most Water
- 查看linux的版本是32位还是64位
- 哈理工 1596 序列问题1
- 从零开始: Spring Cloud微框架系列:spring boot
- 欢迎使用CSDN-markdown编辑器
- udp socket connect一个不存在的地址后调用sendto返回111错误(connect refused)
- mongoose的增删改查操作