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

1 vote206 views1 answer
Change shortcuts in pychar,
Python
8 votes212 views3 answers
Pip install safely in jupyter
Python
0 vote210 views1 answer
Funny application in python
Python
0 vote228 views1 answer
Find number of unique keys in the dictionary
Python
3 votes204 views1 answer
Discord py on ready
Python
3 votes179 views2 answers
Plot bounds python
Python
6 votes207 views1 answer
Getting dummies and input them to pandas dataframe
Python
0 vote226 views1 answer
How to add import pydictionary in python
Python
0 vote212 views1 answer
Pip install google cloud secret manager
Python
1 vote203 views1 answer
Python locks
Python