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

86 votes367 views6 answers
Select random value from list python
Python
8 votes293 views6 answers
How to use list in python
Python
0 vote358 views1 answer
Entry point to programming Spark with the Dataset and DataFrame API
Python
3 votes326 views4 answers
Django setup in windows
Python Django
0 vote326 views1 answer
Python copy file create intermediate directories
Python
9 votes266 views3 answers
A value is trying to be set on a copy of a slice from a DataFrame.
Python
0 vote289 views1 answer
Sort lexo python
Python
0 vote316 views1 answer
If equal to key return value python
Python
4 votes305 views1 answer
Stack data structure python
Python
-2 votes340 views2 answers
Python program to find n prime numbers
Python