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?
public int addDigits(int num) {
int temp=0;
while(num>=10){
temp+=num%10;
num/=10;
if(num<10){
num+=temp;
temp=0;
}
}
return num;
}
}
下边是摘自这个博客 http://my.oschina.net/Tsybius2014/blog/497645
public class Solution {
private int getNum(int num){
String s=String.valueOf(num);
int sum=0;
for(char c:s.toCharArray())
sum +=(c-'0');
return sum;
}
public int addDigits(int num) {
while(num>9)
num=getNum(num);
return num;
}
}
下边这票摘自这里:http://my.oschina.net/Tsybius2014/blog/497645
public class Solution {
public int addDigits(int num) {
return (num - 1) % 9 + 1;//很巧妙的算法
}
}
//num = (a + b + c + d + e) + (a * 9999 + b * 999 + c * 99 + d * 9)
//a * 9999 + b * 999 + c * 99 + d * 9 一定可以被9整除,因此num模除9的结果与 a + b + c + d + e 模除9的结果是一样的。
//对数字 a + b + c + d + e 反复执行同类操作,最后的结果就是一个 1-9 的数字加上一串数字,左边的数字是 1-9 之间的,右侧的数字永远都是可以被9整除的。
//又因为 (x + y) % z = (x % z + y % z) % z,又因为 x % z % z = x % z,因此结果为 (num - 1) % 9 + 1,只模除9一次,并将模除后的结果加一返回