#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.

Follow up:

Could you do it without any loop/recursion in O(1) runtime?

分析每次相加之后的数字和之前的关系

列方程找规律

正则表达式1？2：3

1为真则2，否则3

class Solution {
public:
    int addDigits(int num) {
        if (num==0) return 0;
        int x=num%9;
        return (x!=0)?x:9;
    }
};