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 vote231 views1 answer
Count how many loops that printed in python
Python
78 votes144 views5 answers
Join function in python
Python
4 votes220 views4 answers
Change python version in conda environment
Python
3 votes180 views1 answer
Flask upload
Python Flask
0 vote142 views1 answer
Dot operator in python
Python
-1 vote146 views1 answer
Python all any example
Python
1 vote157 views1 answer
Update python 3.10 ubuntu
Python
0 vote180 views1 answer
Django get latest object
Python Django
1 vote158 views1 answer
Pandas groupby size column name
Python
52 votes162 views6 answers
Sort a dictionary
Python