class Solution {http://
public:
int addDigits(int num) {
int n = num;
while(n/10 != 0)
{
int t = 0;
while(n != 0)
{
t+=n%10;
n = n/10;
}
n = t;
}
return n;
}
};
wikipedia给出的算法 O(1)的时间复杂度
class Solution {
public:
int addDigits(int num) {
int n = num;
if(n/10 == 0)
{
return n;
}
return 1+(n-1)%9;
}
};