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.
以上是原题目要求,以下是博主自己的代码:
public class Solution {
public int addDigits(int num){
int result = 0;
while(num/10>0){
result = result+num%10;// 求出当前数的最后一位
num = num/10;// 将最后一位数字去掉,之后循环进行求当前数字最后一位的操作
}
result = result+num;
if(result>=10){
result = addDigits(result);// 如果第一遍得出的result大于10,则进行递归调用,知道result小于10
}
return result;
}
}