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

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

题意：给一个十进制，让其每一位相加，直到结果小于10
思路：一开始想直接循环相加，但是一看有O（1）的方法，就想怎么解，一直没想出来，看了disscuss才知道。。。真是智商的问题啊啊！！
这题在wiki上有专门的解释。

坑：暂无
代码：
循环的解法

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

O(1)解法

class Solution {
public:
    int addDigits(int num) {
        return 1+(num-1)%9;
    }
};