LeetCode:Add Digits

时间：2016-06-03 19:36:18 阅读：221 评论：0 收藏：0 [点我收藏+]

Total Accepted: 98713 Total Submissions: 202414 Difficulty: Easy

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?

Hint:

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

Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

Hide Similar Problems

java code:

public class Solution {
    public int addDigits(int num) {
        return (num - 1)%9 + 1;
    }
}

原文：http://blog.csdn.net/itismelzp/article/details/51568972

踩

(0)

评论一句话评论（0）

分享档案

更多>