最开始的思路:
class Solution {
public int addDigits(int num) {
int tmp = num;
while (tmp >= 10){
num = tmp;
tmp = 0;
while (num > 0){
int a = num % 10;
tmp += a;
num /= 10;
}
}
return tmp;
}
}
后来发现了树根(digital root)公式,一行Java代码即可:
class Solution {
public int addDigits(int num) {
//digital root
return 1 + (num - 1) % 9;
}
}