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.
class Solution(object):
def addDigits(self, num):
"""
:type num: int
:rtype: int
"""
x = num % 9
if num == 0:
return 0
elif x == 0:
return 9
else:
return x
D69 258. Add Digits 题目链接 258. Add Digits 题目分析 给定一个数字，给每一位...
LeetCode 258. Add Digits Description Given a non-negative...
258. Add Digits[思路]数字累加，将给定的一个整数，将个位，十位，百位等相加，连续操作，直到最后的值...
循环： 这个办法很神奇
Problem Given a non-negative integer num, repeatedly add ...
问题 Given a non-negative integer num, repeatedly add all i...
1.描述 Given a non-negative integer num, repeatedly add all...
C++ Java Javascript 题目问能不能做出不用循环和递归的O（1）复杂度，没做出来，(╯‵□′)╯︵...
Given a non-negative integernum, repeatedly add all its d...
传统的loop方法 我有点讨厌的trick方法： 对于B进制来说 N最后遗留下来的数符合以下规则：1.如果N=0,...
本文标题：258. Add Digits
本文链接：https://www.haomeiwen.com/subject/nkueettx.html
网友评论