本文最后更新于:2023年3月29日 上午
Count Digits
NO.1
This is a transfer int to str. This is not a math solution
1 2 3
| def count_digits1(x): x=str(x) return len(x)
|
NO.2
1 2 3 4 5 6
| def count_digits2(x): count = 0 while x != 0: x = x // 10 count = count +1 return count
|
NO.3
1 2 3 4 5
| def count_digits3(n): if n < 10: return 1 else: return (1 + count_digits3(n //10))
|
This is about Recursion.
Sum Digits
NO.1
1 2 3 4 5
| def sum_digit1(n): if n < 10: return n else: return (n%10 + sum_digit1(n//10))
|
NO.2
1 2 3 4 5 6
| def sum_digit2(n): sum=1 while n != 0: sum = sum * (n%10) n = n // 10 return sum
|