258. Add Digits (Easy)

https://leetcode.com/problems/add-digits/

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.

Example:

Input: 38
Output: 2 
Explanation: 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?

Hints

Solutions

  • Java

https://www.cnblogs.com/grandyang/p/4741028.html

class Solution {
    public int addDigits(int num) {
        int addDigits(int num) {
            return (num == 0) ? 0 : (num - 1) % 9 + 1;
        }
    }
}
Copyright © iovi.com 2017 all right reserved,powered by GitbookLast Modification: 2019-04-03 21:30:59

results matching ""

    No results matching ""