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.
int addDigits(int num) {
int tmp = 0;
while (num >= 10) {
while (num) {
tmp += num % 10;
num /= 10;
}
num = tmp;
tmp = 0;
}
return num;
}