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?

int addDigits(int num) {
	if (num < 10)
		return num;
	else
	{
		int newnum = 0;
		while (num)
		{
			newnum += (num % 10);
			num /= 10;
		}
		return addDigits(newnum);
	}
}

不用循环的话虽然测试可以，但是不知道为什么

int addDigits(int num) {  
      return 1 + (num-1)%9;  
}