Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g0201_0300.s0258_add_digits.Solution

```
public class Solution
extends Object
```
258 - Add Digits.
Easy

Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

Example 1:

Input: num = 38

Output: 2

Explanation:
```
 The process is
 38 --> 3 + 8 --> 11
 11 --> 1 + 1 --> 2
 Since 2 has only one digit, return it. 
```
Example 2:

Input: num = 0

Output: 0

Constraints:
- 0 <= num <= 2³¹ - 1
Follow up: Could you do it without any loop/recursion in O(1) runtime?

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int addDigits(int num)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- addDigits
```
public int addDigits(int num)
```