Python recursive sum of digit

def sum_digits(num: int) -> int:
	
	#base case when your "positive" integer get to 0
    if num == 0: 
        return 0
    #base case when your "negative" integer get is between -10 and 0
    if num > -10 and num < 0:
        return num
	
	# recursion for positive integer
    elif num > 0:
        return (num % 10) + sum_digits(num//10)
	
	# recursion for negative integer
    elif num < 0:
        return -(abs(num) % 10) + sum_digits(-(abs(num)//10))
      
sum_digits(123) # returns 6
sum_digits(-123) # returns -6

Similar codes

0 vote179 views1 answer
Python - oordinated universal time
Python
0 vote169 views1 answer
Contar ocorrências letra string python
Python
14 votes159 views1 answer
Filter list with python
Python
4 votes164 views4 answers
Virtualenv python2
Python
26 votes181 views6 answers
Convert list of strings to ints python
Python
0 vote177 views1 answer
Django multi column index
Python
1 vote182 views1 answer
Like in mysqldb python
Python
1 vote173 views1 answer
.annotate unique distinct
Python
0 vote165 views1 answer
Keras reshape
Python
0 vote159 views1 answer
Checking if a string is in alphabetical order in python
Python