LeetCode刷题笔记--258. Add Digits

258. Add Digits

Easy

379713FavoriteShare

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

Example:

Input: 38
Output: 2 
Explanation: The process is like: 3 + 8 = 11, 1 + 1 = 2. 
             Since 2 has only one digit, return it.

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

这道题感觉不用循环做不出，但是网上确实有简单的方法。

https://blog.csdn.net/jmspan/article/details/51103086