LeetCode 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?

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) {
        return (num-1) % 9 + 1;
    }
}

/*************************************************************************
    > File Name: LeetCode258.c
    > Author: Juntaran
    > Mail: JuntaranMail@gmail.com
    > Created Time: Tue 10 May 2016 07:44:57 PM CST
 ************************************************************************/

/*************************************************************************

    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?

    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.

 ************************************************************************/
 
#include <stdio.h>

int addDigits( int num )
{
    int ret = (num-1) % 9+ 1;
    return ret;
}

int main()
{
    int n = 38;
    int ret = addDigits(n);
    printf("%d
", ret);
    return 0;
}