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 vote211 views1 answer
Time df.apply() python
Python
15 votes258 views3 answers
Python group by multiple aggregates
Python
0 vote266 views1 answer
Python catch output to terminal
Python
1 vote260 views2 answers
Pyqt message box set detailed text
Python
0 vote240 views1 answer
Genrate unique key in python
Python
3 votes232 views1 answer
Iteration
Python
0 vote230 views1 answer
Django table view sort filter
Python
1 vote257 views1 answer
Spacy matcher syntax
Python
0 vote230 views1 answer
Standard streams with python3
Python
1 vote249 views3 answers
How to print to a file in python
Python