leetcode--258. Add Digits

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. >ince 2 has only one digit, return it.

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

思路：要求不用循环，时间复杂度为o(1).这样的话想法只有推导出通用的公式。

前提：
10^k % 9 = 1
a*10^k % 9 = a % 9

比如x为23456：
x = 2* 10000 + 3 * 1000 + 4 * 100 + 5 * 10 + 6
2 * 10000 % 9 = 2 % 9
3 * 1000 % 9 = 3 % 9
4 * 100 % 9 = 4 % 9
5 * 10 % 9 = 5 % 9

Then x % 9 = ( 2+ 3 + 4 + 5 + 6) % 9, note that x = 2* >10000 + 3 * 1000 + 4 * 100 + 5 * 10 + 6

So we have 23456 % 9 = (2 + 3 + 4 + 5 + 6) % 9

int addDigits(int num) {
    if(num == 0)
    {
        return 0;
    }
    if(num % 9 == 0)
    {
        return 9;
    }

    return num % 9;
}