0
/ 1
Description
Write a recursive method int sumDigits(int n) that returns the sum of all the digits in n. The key idea over recursion in...
X1616: Sum the digits (recursive edition)
Description
Write a recursive method int sumDigits(int n) that returns the sum of all the digits in n. The key idea over recursion in this method is:
- Base case: n < 10 → return n
- Recursive case: (n % 10) + sumDigits(n / 10)
Examples:
sumDigits(174) -> 12
sumDigits(2025) -> 9
Your Answer:
Feedback
Your feedback will appear here when you check your answer.