leetcode 258: Add Digits
来源:互联网 发布:网络拓扑结构是什么 编辑:程序博客网 时间:2024/05/01 22:27
Add Digits
Total Accepted: 5383 Total Submissions: 11876Given 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?
[思路]
[CODE]
public class Solution { public int addDigits(int num) { return 1 + (num-1) % 9; }}
0 1
- leetcode 258: Add Digits
- 258Add 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
- leetcode 258 :Add Digits
- leetcode 258--Add Digits
- leetcode 258 Add Digits
- Leetcode #258 Add Digits
- LeetCode 258:Add Digits
- LeetCode 258:Add Digits
- IOS-笔记9(多MVC,View间转换)
- 逆序数的几种求法
- 面试题收集
- 乐透号码
- 我好想再水一百年,hdu1509
- leetcode 258: Add Digits
- Android 笔记2
- Android内存分析工具(三):MAT
- leetcode 263: Ugly Number
- UI计算器的设计
- nginx+FastCGI+c++
- 粗略。。Java项目设计模式之笔记----studying
- GDOI2016模拟8.19总结
- mysql5.6 ERROR 1045 (28000): Access denied for user (using password: NO)