Java > Recursion-1 > sumDigits
prev  |  next  |  chance

Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12). sumDigits(126) → 9 sumDigits(49) → 13 sumDigits(12) → 3 ...Save, Compile, Run public int sumDigits(int n) { } See also Java Example Code. Java help docs: If Boolean Logic | Strings | While and For Loops | Arrays and Loops prev  |  next  |  chance   |  CodingBat  >  Recursion-1

Forget It! -- delete my code for this problem 318.0

Copyright Nick Parlante 2006-10 - privacy