258. Add Digits
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.
Follow up:
Could you do it without any loop/recursion in O(1) runtime?
这题很巧妙,有两种解决方法,如下
1、直接根据题意从低位到高位逐一相加,判断是否满足条件即可:
class Solution(object):
def addDigits(self, num):
"""
:type num: int
:rtype: int
"""
while num >= 10:
num = num/10 + num%10
return num
2、找规律,很明显输出肯定是0-9的数,观察:1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ...对应的输出为1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 ....找到对应的通用公式:output = (num-1)%9 + 1 (num > 0) 或者 output = 0 (num = 0)。这里请注意,python语言遵守余数是自然数的法则。
class Solution(object):
def addDigits(self, num):
"""
:type num: int
:rtype: int
"""
if num == 0:
return 0
return 1 + (num-1)%9