题目: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 static int addDigits(int num) {
int rev = num;
//更新,找到答案
while(true){
rev = getTheTotalOfTheNumber(rev);
if (rev<10) {
return rev;
}
}
}
/**
* 将数字的每位加起来 比如58 返回5+8 = 13
* @param num
* @return
*/
public static int getTheTotalOfTheNumber(int num) {
int rev = 0;
int flag = 0;
while (num>=getTheHighNumber(num)&&flag!=2) {
int temp = num%10;
rev += temp;
num = num/10;
//这个flag就是为了判断结束这个循环,当num已经等于这个最高位连续两次 就跳出循环
//因为第一次需要做加的操作
if (num==getTheHighNumber(num)) {
flag++;
}
}
return rev;
}
//获取最高位的数字 比如传入58 返回5
public static int getTheHighNumber(int tem){
while(tem>=10){
tem=tem/10;
}
return tem;
}
我的这个方法 也Ac了,但是感觉有点让人费解。我看了下别人的答案。
public int addDigits(int num) {
return num==0?0:(num%9==0?9:(num%9));
}
当num为0返回0
当num为9 返回9
其他返回num%9
仔细一观察,这个答案是对的。。。