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.
Difficulty: Easy
public class Solution {
public int addDigits(int num) {
if(num <= 9)
return num;
int ans = 0;
while(num != 0){
ans += num%10;
num = num/10;
}
return addDigits(ans);
}
}