258 Add Digits

原题描述

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?

Hint:

A naive implementation of the above process is trivial. Could you come up with other methods?
What are all the possible results?
How do they occur, periodically or randomly?
You may find this Wikipedia article useful.

分析

1.将整形数各位累加得到一个新的整型数
2.将新的整型数代入1中重复直到得到一个一位数
用递归很容易实现，此题目的其实是为了说明一个数学知识，感觉没什么用没看。

代码示例

class Solution {
public:
    int myadd(int num)
    {
        int sum = 0;
        while(num / 10 != 0)
        {
            sum += num % 10;
            num /= 10;
        }
        sum += num;
        return sum;
    }
    int addDigits(int num) 
    {
        if (num < 10)
            return num;
        else
            return addDigits(myadd(num));
    }
};