首页 > 其他 > 详细

258. Add Digits

时间:2016-05-22 21:27:20      阅读:124      评论:0      收藏:0      [点我收藏+]

Problem:

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?

A possible solution:

int addDigits(int num) {
    int temp;
    while(num >= 10)
    {
        while(num >= 10)
        {
            temp += num%10;
            num = num/10;
        }
        num  += temp; 
        temp = 0;
    }
    return num;
}

 more efficient way:

int addDigits(int num) {
    return (num-1)%9 + 1;
}

  

 

258. Add Digits

原文:http://www.cnblogs.com/liutianyi10/p/5517753.html

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