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.

C语言解答：

int addDigits(int num) {    int result = num;    while(result >= 10)    {        int temp = 0;        while(result / 10 != 0)        {            temp = temp + result % 10;            result = result / 10;        }        result = result + temp;    }    return result;}