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

7 votes273 views2 answers
Numpy create a matrix of certain value
Python
0 vote274 views1 answer
Matplotlib legend put larget dot
Python
0 vote276 views1 answer
Strip in split python
Python
0 vote255 views1 answer
Dataclass in python
Python
7 votes280 views4 answers
How to use lambda function in python
Python
0 vote251 views1 answer
Ignoring warnings
Python
4 votes276 views2 answers
Python soup get href
Python
0 vote268 views1 answer
BusyIndicator Import
Python
0 vote279 views1 answer
Expanding nebula foobar
Python
0 vote308 views2 answers
Create dictionary without removing duplicates from dataframe
Python