[C]LeetCode:Add Digits

Add DigitsGiven 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?

解法1：一开始是为了accepted使用了循环完成，代码如下：

int addDigits(int num) {
    int i=0;
    if (num<10)
        return num;
    while(num>=10)
    {
        if(num>10)
        {
            i+=num%10;
            num=num/10;  
        }
        if(num==10)
        {
            num=1;
            i+=num;
            num=i;
            i=0;
        }
        if(num<10)
        {
            i+=num;
            num=i;
            i=0;
        }
    }
    return num;
}

完成后 时间复杂度为O(n)

解法2：`考虑如何实现O(1)的要求，举例：若num=a*10000+b*1000+c*100+d*10+e 则取和为num=a+b+c+d+e=（a+b+c+d+e）+(a*9999+b*999+c*99+d*9)%9 那么可依次取模下去，直到所得数值为1~9之间，且防止9%9的情形，则最终为(num-1)%9+1,测试，accepted：

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