LeetCode_258. Add Digits

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求余数，得到每一位的值，再相加，代码上比较冗余。参考http://blog.csdn.net/sbitswc/article/details/47975581后，发现：
假设381，3+8+1=12， 1+2=3；
38+1=39， 3+9=12， 1+2=3.
c++:

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

Top Solution :
找规律（其实有数根公式。。）
0~9: 0,1,2,3,4,5,6,7,8,9
10~19: 1,2,3,4,5,6,7,8,9,1
20~29: 2,3,4,5,6,7,8,9,1,2
30~39: 3,4,5,6,7,8,9,1,2,3
…
以9为周期循环。
(num-1)%9+1.

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