刷题day1---digital root

题目：
A digital root is the recursive sum of all the digits in a number. Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced. This is only applicable to the natural numbers.

Here’s how it works:（示例）

digital_root(16)
=> 1 + 6
=> 7

digital_root(942)
=> 9 + 4 + 2
=> 15 ...
=> 1 + 5
=> 6

digital_root(132189)
=> 1 + 3 + 2 + 1 + 8 + 9
=> 24 ...
=> 2 + 4
=> 6

digital_root(493193)
=> 4 + 9 + 3 + 1 + 9 + 3
=> 29 ...
=> 2 + 9
=> 11 ...
=> 1 + 1
=> 2

思路：digital_root函数是求数字中所有数字的递归和，每次求和即将各个位数上的数字加在一起，直到只有个位数停止，因为个位数求和的结果为本身。

求和思路：

1. 声明一个变量sum，记录数字和
2. sum等于每次除10后的余数之和
3. 取余后然后取整，接着对整数取余，加和，直到整数为0
4. 当一轮求和完成后，将sum赋值给n，若n仍旧不为个位数，继续重复1~3步，直到n为0为止。

代码：

int digital_root(int n)
{
    // ...
    while(n/10!=0)
    {
        int sum =0;
        while(n!=0)
        {
            int temp = n%10;
            n = n/10;
            sum+=temp;
        }
        n = sum;
    }
    return n;
}