题目描述:
Given a non-negative integer num
, repeatedly add all its digits until the result has only one digit.
Example:
Input: 38
Output: 2
Explanation: 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)。
其实列举一些数字就会发现,最终结果是循环出现的,例如10->1,11->2,12->3,13->4,14->5,15->6,16->7,18->9,19->1, 20->2,当数值增加一,最终迭代结果也加一,但是一旦超出9就又回到0。
class Solution {
public:
int addDigits(int num) {
if(num==0) return 0;
int result=num%9;
if(result==0) return 9;
else return result;
}
};