leetcode 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?
复杂度
O(1)
代码
public class Solution {
public int addDigits(int num) {
while(num>9){
int n=0;
while(num>9){
n=n+num%10;
num=num/10;
}
num=n+num%10;
}
return num;
}
}
说明
1,以上是我的解法,为啥感觉时间复杂度不是O(1),但是被Accept了。
2,关于(n-1)%9+1的解法木有看懂!