标签：border 分享 src repeat 表格 could ica 一行代码 alt
2017/3/16 22:36:02
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
For example:
Given num = 38, 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?
publicclassSolution{publicint addDigits(int num){while( num /10!=0) num = num/10+ num%10;return num;}}
publicclassSolution{publicint addDigits(int num){return num %9==0? num ==0?0:9: num%9;}}标签：border 分享 src repeat 表格 could ica 一行代码 alt
原文地址：http://www.cnblogs.com/flyfatty/p/6624804.html
