Description
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
Example
Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.
Explain
做过acm的应该都知道%9的黑魔法,,
Code
class Solution(object):
def addDigits(self, num):
"""
:type num: int
:rtype: int
"""
if num < 10:
return num
return num % 9 if num % 9 else 9