[codewars_python]Sum

Instructions

In this kata, you must create a digital root function.

A digital root is the recursive sum of all the digits in a number. Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced. This is only applicable to the natural numbers.

Here's how it works:

代码语言：javascript复制

digital_root(16)
=> 1   6
=> 7

digital_root(942)
=> 9   4   2
=> 15 ...
=> 1   5
=> 6

digital_root(132189)
=> 1   3   2   1   8   9
=> 24 ...
=> 2   4
=> 6

digital_root(493193)
=> 4   9   3   1   9   3
=> 29 ...
=> 2   9
=> 11 ...
=> 1   1
=> 2

My solution:

代码语言：javascript复制

def digital_root(n):
    lst = [int(x) for x in str(n)]
    result = sum(lst)
    if result < 10:
        return result
    else:
        return digital_root(result)

Best solution:

代码语言：javascript复制

def digital_root(n):
    return n if n < 10 else digital_root(sum(map(int,str(n))))

digits numbers root sum this

0 人点赞