258. Add Digits

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

Example:

Input: 38
Output: 2 
Explanation: 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?

Hint:

A naive implementation of the above process is trivial. Could you come up with other methods?

What are all the possible results?

How do they occur, periodically or randomly?

You may find this Wikipedia article useful.

方法1:

思路：

不断取余相加直到<10。

Complexity

Time complexity: ?
Space complexity: (1)

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

方法2:

思路：

要求不用loop。这里存在一个数学概念叫digit roots: https://en.wikipedia.org/wiki/Digital_root.
0 0
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 1
11 2
12 3
13 4
14 5
15 6
16 7
17 8
18 9
19 1
20 2
21 3

所以除了0以外，9个数是一个循环，只需要对9取余，并进一步处理余数是0的情况：余0说明digit roots = 9。

所以代码如下：

class Solution {
public:
    int addDigits(int num) {
        return num == 0 ? 0 : (num % 9 == 0 ? 9 : num % 9);
    }
};

Complexity

Time complexity: O(1)
Space complexity: O(1)