【LeetCode】258. Add Digits

问题描述

问题链接:https://leetcode.com/problems/add-digits/#/description

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.

我的代码

思路是看了wiki的文章才有的。代码如下:

public class Solution {
    public int addDigits(int num) {
        /*
        思路:看了https://en.wikipedia.org/wiki/Digital_root的解释
        答案就是如果digit_root=9,那么这个数就是9的倍数,如果digit_root<9,那就是这个数-digit_root是9的倍数
        所以取模计算即可得到结果,不过注意对<=9和9的倍数的数的处理。
        */
        return num <= 9?num:(num % 9 == 0?9:num%9);
    }
}

打败了24.54%的Java代码。来看看讨论区。

讨论区

Accepted C++ O(1)-time O(1)-space 1-Line Solution with Detail Explanations

链接地址:https://discuss.leetcode.com/topic/21498/accepted-c-o-1-time-o-1-space-1-line-solution-with-detail-explanations

这个厉害了,套路深啊。

class Solution {
public:
    int addDigits(int num) {
        return 1 + (num - 1) % 9;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值