X279: Recursion Programming Exercise: Sum of the Digits

For function 'sumOfDigits', write the missing recursive call. This function takes a non-negative integer and returns the sum of its digits.

Examples:

sumOfDigits(1234) -> 10

Your Answer:

public int sumOfDigits(int number) {

 if (number < 10)

  return number;

 return <<Missing a Recursive case action>>

}

​

Feedback