leetcode258 Add Digits
来源:互联网 发布:北京刚毕业程序员工资 编辑:程序博客网 时间:2024/06/09 22:32
258. Add Digits
Total Accepted: 74723 Total Submissions: 155249 Difficulty: Easy
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 1 + (num - 1) % 9; }};
0 0
- LeetCode258:Add Digits
- leetcode258 Add Digits
- leetcode258 Add Digits
- leetcode258: Add Digits
- [LeetCode258] Add Digits
- LeetCode258 Add Digits
- leetcode258 Add Digits java
- python--leetcode258. Add Digits
- LeetCode258——Add Digits
- leetcode258-Add Digits(非负整数各位相加)
- LeetCode258
- leetcode258
- Add Digits
- Add Digits
- Add Digits
- Add Digits
- Add Digits
- Add Digits
- Chipscope使用简介
- Java之关于标识符
- 安装Visio 2013 :安装程序找不到Office.zh-cn\osetupui.dll
- 支付宝SDK相关资料
- A - Dungeon Master
- leetcode258 Add Digits
- POJ-1323 Game Prediction
- iOS个人封装图片下载:Block与Delegate两种方式
- Odoo 8.0深入浅出开发教程(六) Odoo开发例子之to-do模块
- JAVA源码学习-HashMap
- ubuntu 安装sklearn
- 上机题目(初级)- 滚雪球(Java)
- ACM常识小知识
- linux awk命令详解