How can I convert these two functions to use lambda notation?
def sum_digits(number):
if number == 0:
return 0
else:
return (number % 10) + sum_digits(number / 10)
def count_digit(number):
if number == 0:
return 0
else:
return 1 + count_digit(number/10)
sum_digits = lambda number: 0 if number == 0 else (number % 10) + sum_digits (number / 10)
count_digit = lambda number: 0 if number == 0 else 1 + count_digit(number/10)
Incidentally, this is a bad time to use lambdas, since you need the function names in order for them to call themselves. The point of lambdas is that they're anonymous.
digits(number, sum_digits) even when it's not a lambda.A string-oriented approach wouldn't require recursion:
sum_of_digits = lambda n: sum(int(d) for d in str(n))
count_digit = lambda n: len(str(n))
Use a conditional expression for the body of the lambda:
>>> sum_digits = lambda n: 0 if n == 0 else (n % 10) + sum_digits(n // 10)
>>> count_digit = lambda n: 0 if n == 0 else 1 + count_digit(n // 10)
Also, if is preferred to use // for the division so that the code will still work in Python 3.
sum_digits = lambda number: 0 if number == 0 else (number % 10) + sum_digits (number//10)
count_digit = lambda number: 0 if number == 0 else 1 + count_digit(number//10)
print(sum_digits(2546))
print(count_digit(2546))
Will work on python 3 too...
print(list(map(lambda x: sum(int(i) for i in str(x)),list(map(int,input().split())))))
this might be useful for reading and using lamda function on the same line.
