算法分析与设计——LeetCode Problem.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?

解题思路

总结规律后可知对于一个整数，这个整数本身与他自身的各个数位上的和关于9同模。对这题而言，当num模9结果为0时，若num为0则返回0，其余情况返回9即可

代码如下

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