LeetCode:Add Digits
来源:互联网 发布:mac os 删除照片 编辑:程序博客网 时间:2024/05/08 02:28
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 floor(int x) { return (x - 1) / 9; } int addDigits(int num) { return num - 9 * floor(num); }};
0 0
- [leetcode][math] Add Digits
- [leetcode] Add Digits
- 【leetcode】Add Digits【java】
- Leetcode: Add Digits
- LeetCode Add Digits
- [LeetCode] Add Digits
- leetcode 258: Add Digits
- LeetCode题解:Add Digits
- leetcode: Add Digits
- 258Add Digits - LeetCode
- leetCode #258 Add Digits
- [LeetCode 258] Add Digits
- LeetCode: Add Digits
- LeetCode:Add Digits
- leetcode--add digits
- leetcode Add Digits
- leetcode--Add Digits
- leetcode Add Digits
- CSS--display(flex重点)
- 关于图片优化
- android 5.0新增的控件总结
- php常用Stream函数集介绍
- Android性能优化之内存泄露篇
- LeetCode:Add Digits
- Linux基础知识之挂载详解(mount,umount及开机自动挂载)
- 一、Composer下载安装
- Android属性动画完全解析(上),初识属性动画的基本用法
- [UWP]附加属性2:实现一个Canvas
- MyEclipse下的web项目各文件作用
- Eclipse的安装过程(附资源)
- HashMap的put方法返回值
- leetcode