FilesExpand file tree

 master

/

AddDigits.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

24 lines (21 loc) · 642 Bytes

 master

/

AddDigits.java

Copy path

Top

File metadata and controls

• Code
• Blame

24 lines (21 loc) · 642 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

package math;

/**

* Created by gouthamvidyapradhan on 02/08/2017. Given a non-negative integer num, repeatedly add

* all its digits until the result has only one digit.

*

* <p>For example:

*

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

* it.

*

* <p>Follow up: Could you do it without any loop/recursion in O(1) runtime?

*/

public class AddDigits {

public static void main(String[] args) throws Exception {

System.out.println(new AddDigits().addDigits(38));

}

public int addDigits(int num) {

if (num == 0) return 0;

return num % 9 == 0 ? 9 : num % 9;

}

}