LN : leetcode 258 Add Digits

2024-09-30 20:39:41

lc 258 Add Digits

lc 258 Add Digits

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?

analysation##

digital root from baike

solution

int addDigits(int num) {

  if (num > 9 && num%9 == 0)

  return 9;

  if (num > 9)

  return num%9;

  return num;

}

最新文章

热门文章