擅长:python、mysql、java
<p>你必须继续这个过程,直到你得到长度1。你可以写递归函数来做到这一点</p>
<pre><code>def digital_root():
n = input("Enter the number:")
print("The digital root of " + n + " is: " + recur(n))
return sum
def recur(n):
sum = 0
if len(n) == 1:
return n
else:
for x in n:
sum += int(x)
return recur(str(sum))
digital_root()
</code></pre>