首页 > 其他 > 详细

[leetcode] 258. Add Digits

时间:2016-09-04 23:51:19      阅读:273      评论:0      收藏: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 = 111 + 1 = 2. Since 2 has only one digit, return it.

Follow up:
Could you do it without any loop/recursion in O(1) runtime?

递归,num/10 与 num%10

一刷:

    public int addDigits(int num) {
        int sum=0;
        while(num != 0){
            sum+=num%10;
            num=num/10;
        }
        return sum > 9 ? addDigits(sum):sum;
    }

 

[leetcode] 258. Add Digits

原文:http://www.cnblogs.com/pulusite/p/5840614.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!