Leet Code OJ 258. Add Digits [Difficulty: Easy]

原创于 2016-02-26 14:09:24 发布 · 1.6k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

算法题解

每周一道算法题

本文介绍了一种将非负整数连续相加直至得到一位数的递归算法。通过实例演示了从38开始的加和过程，并探讨了O(1)时间复杂度的可能实现。

题目：
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?

代码实现：

public class Solution {
    public int addDigits(int num) {
        if(num>9){
            return addDigits(num%10+addDigits(num/10));
        }else{
            return num;
        }
    }
}