leetcode

[LeetCode] 258. Add Digits

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 = 1){ val += temp % 10; temp = parseInt(temp/10); } num = val; } return num }; 위 코드와 같이 간단하게 각 자리의 숫..