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 vote332 views1 answer
How to use pca using scikit learn
Python
24 votes322 views4 answers
Return max integer from list
Python
0 vote325 views1 answer
Make sure text is on page selenium python
Python
12 votes387 views6 answers
List python
Python
0 vote344 views2 answers
Convert pdf folder to excell pandas
Python
0 vote353 views1 answer
Hand tracking module
Python
0 vote352 views1 answer
Matplotlib x tlabels ax.set_xlabel
Python
37 votes354 views6 answers
Lambda functions python
Python
0 vote345 views1 answer
Getting Random rows in dataframe
Python
0 vote386 views1 answer
Cannot cast type smallint to boolean django
Python Django