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?

Hints:

https://en.wikipedia.org/wiki/Digital_root

The formula is:

{\displaystyle \operatorname {dr} (n)={\begin{cases}0&{\mbox{if}}\ n=0,\\9&{\mbox{if}}\ n\neq 0,\ n\ \equiv 0{\pmod {9}},\\n\ {\rm {mod}}\ 9&{\mbox{if}}\ n\not \equiv 0{\pmod {9}}\end{cases}}}

or,

{\displaystyle {\mbox{dr}}(n)=1\ +\ ((n-1)\ {\rm {mod}}\ 9).\ }

To generalize the concept of digital roots to other bases b, one can simply change the 9 in the formula to b - 1.

My code:

class Solution(object):
    def addDigits(self, num):
        """
        :type num: int
        :rtype: int
        """
        if num ==0:
            return 0
        else:
            return 1+(num-1)%9