Java program to find sum of each digit in the given number using recursion


Levels of difficulty: / perform operation:

Below example shows how to find out sum of each digit in the given number using recursion logic. For example, if the number is 259, then the sum should be 2+5+9 = 16.

Program

package com.scanftree.algos;
public class MyNumberSumRec {
	int sum = 0;
	public int getNumberSum(int number) {
		if(number == 0) {
			return sum;
		} else {
			sum += (number%10);
			getNumberSum(number/10);
		}
		return sum;
	}
	public static void main(String a[]) {
		MyNumberSumRec mns = new MyNumberSumRec();
		System.out.println("Sum is: "+mns.getNumberSum(223));
	}
}

Output

Output:
Sum is: 7






Quantitative Aptitude
Reasoning
Programming
Interview