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 int addDigits(int num) {
2     if(num == 0)
3         return 0;
4     if(num % 9 == 0)
5         return 9;
6     return num % 9;
7 }

Add Digits

原文：http://www.cnblogs.com/boluo007/p/5483487.html