258. Add Digits Add to List(整数位上数字相加直到小于10)

DescriptionSubmissionsSolutions
Total Accepted: 155076
Total Submissions: 306484
Difficulty: Easy
Contributor: LeetCode
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.

解法1:
//设置计数器sum来依次储存位数上的数字,若sum>=10,并且整数全部循环相加完毕,则让sum的值赋值给num
class Solution {
public:
    int addDigits(int num) {
        int b,sum=0;
        if(num==0)
            return 0;
    while (num>0)
    {
        b = num % 10;
        sum += b;
        num /= 10;
        if (sum>=10 &&num == 0)
        {
            num = sum;
            sum = 0;
        }
    }
    return sum;

    }
};

//解法2: 化简版
class Solution {
public:
    int addDigits(int num) {
        while (num / 10 > 0) {
            int sum = 0;
            while (num > 0) {
                sum += num % 10;
                num /= 10;
            }
            num = sum;
        }
        return num;
    }
};

//解法3:
1    1
2    2
3    3
4    4
5    5
6    6
7    7
8    8    
9    9    
10    1
11    2
12    3    
13    4
14    5
15    6
16    7
17    8
18    9
19    1
20    2
//规律看出来没有
每9个一循环，所有大于9的数的树根都是对9取余，那么对于等于9的数对9取余就是0了，为了得到其本身，而且同样也要对大于9的数适用，我们就用(n-1)%9+1这个表达式来包括所有的情况，所以解法如下：
class Solution {
public:
    int addDigits(int num) {
        return (num - 1) % 9 + 1;
    }
};
//参考:
http://www.cnblogs.com/grandyang/p/4741028.html