leetcode submission/20161013(add digits)

今天突然多了一堆bug，神烦

Topic:

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?

 solution:

this topic can be solved in either the stupid way or smart way.

stupic way:

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;
    }
};

smart way:

find the goddamn regulation:

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