[220208] Add Digits

Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

class Solution:def addDigits(self, num):while len(str(num)) > 1:res = 0length = len(str(num))# 每一位数加上去for i in range(length):res += int(str(num)[i])# 给 num 重新赋值num = resreturn num

class Solution:def addDigits(self, num):# 特例：0 --> 0if num == 0:return 0# 能被 9 整除的数 --> 9elif num % 9 == 0:return 9# 其余数字 --> 找最近一个能被 9 整除的数，计算差值 (mod 9)else:return num % 9

[220208] Add Digits相关推荐

Leetcode刷题记录[python]——258 Add Digits
一.前言做这题有个小收获,关于Digital root的解法,有个极方便的小公式: 二.题258 Add Digits Given a non-negative integer num, repea ...
leetcode Add Digits
题目连接 https://leetcode.com/problems/add-digits/ Add Digits Description Given a non-negative integer n ...
[LeetCode] Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. ...
[leetcode][math] Add Digits
题目: Given a non-negative integer num, repeatedly add all its digits until the result has only one di ...
[LeetCode] Add Digits - 数字各个位数求和
题目概述: Given a non-negative integer num, repeatedly add all its digits until the result has only one ...
Leet Code OJ 258. Add Digits [Difficulty: Easy]
题目: Given a non-negative integer num, repeatedly add all its digits until the result has only one di ...
LeetCode之Add Digits
1.题目 Given a non-negative integer num, repeatedly add all its digits until the result has only one d ...
LeetCode 258. Add Digits
题目: Given a non-negative integer num, repeatedly add all its digits until the result has only one di ...
C#LeetCode刷题之#258-各位相加（Add Digits）
问题该文章的最新版本已迁移至个人博客[比特飞],单击链接 https://www.byteflying.com/archives/3860 访问. 给定一个非负整数 num,反复将各个位上的数字相加 ...

[220208] Add Digits

[220208] Add Digits相关推荐

最新文章

热门文章