repeatedly add all digits from a positive number until the result has only one digit - Java Algorithm

Java examples for Algorithm:Number

  1. HOME
  2. Java
  3. Algorithm
  4. Number

Introduction

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

For example:

Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, return it.

Demo Code



public class Main {

    public static void main(String[] args) {
        System.out.println(new Solution().addDigits(33));
    }/*from  ww  w . ja va2  s .  c  o  m*/
}

class Solution {
 
    public int addDigits(int num) {
        return 1 + (num - 1) % 9;
    }
}

Related Tutorials