codewars--Sum of Digits

honeybabyqinqin

于 2018-12-12 19:19:41 发布

阅读量295

点赞数

CC 4.0 BY-SA版权

分类专栏： codewars 文章标签： python codewars

本文链接：https://blog.youkuaiyun.com/weixin_41871914/article/details/84977950

codewars 专栏收录该内容

16 篇文章

订阅专栏

该博客介绍了如何在Codewars上解决'Sum of Digits'问题，即数字根的计算。数字根是通过递归求和所有数字得到的值，直到结果为一位数。文章探讨了使用while而不是if的原因，并解释了map()函数在转换数字到字符串并求和过程中的作用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Sum of Digits / Digital Root

problem describtion:

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 two digits, continue reducing in this way until a single-digit number is produced. This is only applicable to the natural numbers.

在这里插入图片描述

Method:

def digital_root(n):
    while n >= 10:
        n=sum(map(int,str(n)))
        digital_root(n)
    return n

If you replace while with if,you can’t get true.Also.I don’t know the reason.

Explanation:

the function of map() :

map(function, iterable, ...)

Using the map() function maps the specified sequence based on the supplied function. The first parameter function, uses the function with each element in the parameter sequence, returning a new list ,containing the values returned by each function with each element.
Here you need to convert the int to string, and then sum() is used directly to sum the string. Using a recursion , calculating a new value determines whether it is a two-digit number.