258. Add Digits #Easy

leetcode 258. Add Digits #Easy

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.

举例找规律，num=0~9， return num

num=10 return 1

num=11 return 2

...

num=18 return 9

总结：num小于10，返回num；num>=0，且被9整除，返回9，否则返回num%9

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