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

2 votes131 views1 answer
What is the index in python
Python
0 vote119 views2 answers
Scroll to bottom in selenium python
Python
0 vote116 views1 answer
Debug console shows blank
Python
0 vote124 views1 answer
Group by in ruby mongoid
Python
2 votes130 views1 answer
Predicate
Python
0 vote131 views1 answer
Flask decoding base 64 image
Python
0 vote122 views1 answer
Parse list from string
Python
7 votes142 views2 answers
Tkinter button command with arguments
Python
0 vote144 views1 answer
Create python package ros 2
Python
1 vote134 views1 answer
Save np array as mat file
Python