题目:
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.
稍微翻译下:把数字的各个位置相加,循环往复这么做,知道相加的和为个位数。
Java 代码实现:
public int addDigits(int num) {
while (num / 10 > 0) {
int sum = 0;
while (num > 0) {
sum += num % 10;
num = num / 10;
}
num = sum;
}
return num;
}
Lua 代码实现:
function addDigits(num)
while (math.modf(num / 10) > 0) do
sum = 0
while (num > 0) do
sum = sum + num % 10
num = math.modf(num / 10)
print(sum .. "," .. num)
end
num = sum
end
return num
end
print(addDigits(19))
注意: Java 的 / 是整数除法,而 lua 不是整数除法, lua 整数除法是 math.modf(a/b)