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?
Hint:
- A naive implementation of the above process is trivial. Could you come up with other methods?
- What are all the possible results?
- How do they occur, periodically or randomly?
- You may find this Wikipedia article useful.
基本思路:
Digital root,维基百科详细的介绍这个问题:https://en.wikipedia.org/wiki/Digital_root
10进制下的 解法公式为:
- dr(n) = 0 if n == 0
- dr(n) = 9 if n != 0 and n % 9 == 0
- dr(n) = n mod 9 if n % 9 != 0
or
- dr(n) = 1 + (n - 1) % 9
即数为0时,结果为0;被9整除时,结果为9;其他则为对9的余数。
基本上就是为9的余数,再加上两个特例。
可以从下面的规律,比较直观的理解和推导这个公式。
~input: 0 1 2 3 4 ...
output: 0 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 1 2 3 ....
当输入的整数递增时,输出的dr是周期性的。
简单的证明一下这个周期性:
digit root基本运算为:个位数 和 其他位上的数相加。
当两个输入的数个位数相差1时,其digit root的运算结果也只会相差1.
class Solution {
public:
int addDigits(int num) {
return 1 + (num-1) % 9;
}
};