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 vote324 views1 answer
Python pool.map() function
Python
0 vote298 views1 answer
Add items to list python
Python
0 vote299 views2 answers
Switching versions of python
Python
0 vote314 views1 answer
How to get values in each cluster
Python
5 votes350 views2 answers
Python captcha
Python
0 vote325 views1 answer
NotImplementedError: cannot instantiate 'PosixPath' on your system fast ai
Python
0 vote329 views1 answer
When was barracoon written
Python
0 vote310 views1 answer
What takes more memory string or list python
Python
9 votes311 views2 answers
Python script to read all file names in a folder
Python
0 vote331 views1 answer
Grouped bar chart with labels
Python