[Java] LeetCode 258 : Add Digits

LeetCode # 258

---

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.

 

Constraints:

• 0 <= num <= 2ⁿ - 1  (n=31)

---

Solution #1 (1ms)

class Solution {
    public int addDigits(int num) {
        int sum = 0;

        while (num > 0) {
            sum += num % 10;
            num = num / 10;

            if (sum > 9 && num == 0) {
                num = sum;
                sum = 0;
            }
        }

        return sum;
    }
}

 

Result #1

 

---

 

More Algorithm!

 

👇👇

 

github.com/ggujangi/ggu.leet-code

ggujangi/ggu.leet-code

 

 

 

 

출처 : leetCode