我们先来看一道原题:
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?
数字根问题概述(digital roots):如果把一个大数的各位数字相加得到一个和,再把这个和的各位数字相加又得一个和,再继续作数字和,直到最后的数字和是个位数为止,这最后的数称为最初那个数的“数字根”.这个数字根等于原数除以9的余数,因此这个计算过程常常称为“合九法”。
如上所述,C语言代码如下:
int addDigits(int num) {
if(num==0)
return 0;
num=num%9;
if(num==0)
return 9;
return num;
} //代码非原创,来自评论区大佬