题目链接:https://leetcode.com/problems/add-digits/
runtime:8ms
1、问题
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?
2、分析
一看要求就知道应该是规律题,因此列了一下数字:
0 → 0
1 → 1
2 → 2
…
9 → 9
10 → 1
11 → 2
…
18 → 9
19 → 1
20 → 2
…
27 → 9
28 → 1
29 → 2
…
36 → 9
…
90 → 9
91 → 1
92 → 2
…
99 → 9
100 → 1
…
太吓人了,不分析还真不知道。除了第一个数0,以后的数对应的结果都是9的余数,当然9的倍数返回的应该是9。于是数学公式就出来了。
3、小结
规律题。
4、实现
class Solution {
public:
int addDigits(int num) {
if(0 == num)
return 0;
int temp = num % 9;
if(0 == temp)
return 9;
else
return temp;
}
};
5、反思
学会如何分析规律,从列举开始。