Add Digits

作者: W有来有去 | 来源:发表于2016-08-05 10:24 被阅读7次

Add Digits
258 Add Digits
Leetcode PHP题解--D69 258. Add Dig
2019-02-02
258. Add Digits
258. Add Digits
258. Add Digits
258. Add Digits
258. Add Digits
2、Add Digits（Easy）

Question:

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: integer root

Solution:

java:

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

Add Digits
Question: Given a non-negative integer num, repeatedly ad...
258 Add Digits
原题链接：Add Digits 这是一道数学题，代码如下：我不讲解这道题，大家直接看下面这张图就能明白了。
Leetcode PHP题解--D69 258. Add Dig
D69 258. Add Digits 题目链接 258. Add Digits 题目分析给定一个数字，给每一位...
2019-02-02
LeetCode 258. Add Digits Description Given a non-negative...
258. Add Digits
258. Add Digits[思路]数字累加，将给定的一个整数，将个位，十位，百位等相加，连续操作，直到最后的值...
258. Add Digits
循环：这个办法很神奇
258. Add Digits
Problem Given a non-negative integer num, repeatedly add ...
258. Add Digits
问题 Given a non-negative integer num, repeatedly add all i...
258. Add Digits
1.描述 Given a non-negative integer num, repeatedly add all...
2、Add Digits（Easy）
Problem Description Given a non-negative integer num, rep...