关闭

Add Digits

标签: leetcode
38人阅读 评论(0) 收藏 举报
分类:

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?

枚举1-20可发现所有的数字之间都是有规律的,以9为周期,不断循环

public class Solution {
    public int addDigits(int num) {
         if(num %9 !=0)
         return num%9;
         if(num==0)
         return 0;
         return 9;

    }
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:948次
    • 积分:221
    • 等级:
    • 排名:千里之外
    • 原创:22篇
    • 转载:0篇
    • 译文:0篇
    • 评论:1条
    文章分类
    最新评论