Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
For example:
Given num = 38The process is like this: 3 + 8 = 11, 1 + 1 = 2Since 2 has only one digit, return it.
Follow up:
Could you do it without any loop/recursion in O(1) runtime?
class Solution { public int addDigits(int num) { while(num >= 10){ num = num/10 + num%10; } return num; } } This siteOriginal articleAll follow "Attribution-NonCommercial-ShareAlike 4.0 License (CC BY-NC-SA 4.0)Please retain the following annotations when sharing or adapting:
Original author:Jake Tao,source:258. Add Digits
