Leetcode no. 258

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 = 111 + 1 = 2. Since 2 has only one digit, return it.

Follow up:
Could you do it without any loop/recursion in O(1) runtime?

Hint:

  1. A naive implementation of the above process is trivial. Could you come up with other methods?
  2. What are all the possible results?
  3. How do they occur, periodically or randomly?
  4. You may find this Wikipedia article useful.

public class Solution {
    public int addDigits(int num) {
        if (num==0) return 0;
        return (num % 9==0) ? 9 : (num % 9);
    }
}


阅读更多
个人分类: leetcode
上一篇Leetcode no. 350
下一篇Leetcode no. 306
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭