LeetCode题解——Add Digits
来源:互联网 发布:vscode代码格式化 编辑:程序博客网 时间:2024/05/17 01:13
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?
The problem, widely known as digit root problem, has a congruence formula:
https://en.wikipedia.org/wiki/Digital_root#Congruence_formula
For base b (decimal case b = 10), the digit root of an integer is:
- dr(n) = 0 if n == 0
- dr(n) = (b-1) if n != 0 and n % (b-1) == 0
- dr(n) = n mod (b-1) if n % (b-1) != 0
or
- dr(n) = 1 + (n - 1) % 9
Note here, when n = 0, since (n - 1) % 9 = -1, the return value is zero (correct).
From the formula, we can find that the result of this problem is immanently periodic, with period (b-1).
Output sequence for decimals (b = 10):
~input: 0 1 2 3 4 ...
output: 0 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 1 2 3 ....
Henceforth, we can write the following code, whose time and space complexities are both O(1).
class Solution {public: int addDigits(int num) { return 1 + (num - 1) % 9; }};
Thanks for reading. :)
- LeetCode题解——Add Digits
- LeetCode题解:Add Digits
- LeetCode 题解(182): Add Digits
- Leetcode题解 258. Add Digits
- LeetCode 258: Add Digits 题解
- LeetCode 258. Add Digits 题解
- 【Leetcode题解】258.Add Digits
- LeetCode 258. Add Digits 题解(C++)
- LeetCode[258]——Add Digits
- 渣渣写LEETCODE——258. Add Digits
- LeetCode ——258.Add Digits
- Leetcode——258. Add Digits
- leetcode——258——Add Digits
- leetcode解题报告258——Add Digits
- leetcode刷题日记——Add Digits
- LeetCode OJ刷题历程——Add Digits
- leetcode算法——258:Add Digits(基于JAVA)
- leetcode学习篇五——Add Digits
- PAT(甲级)1096
- C#中关于@的用法
- Jackson 高性能的JSON处理 ObjectMapper
- 图形验证码one
- JavaScript:instanceof
- LeetCode题解——Add Digits
- PAT(甲级)1097
- JSP解析JSONObject类型对象出现null object异常解决方案
- Mybatis系列(二)配置
- spring使用手动装载依赖的bean
- PAT(甲级)1098
- JS Map 和 List 的简单实现代码
- JavaScript:继承
- hdu1199 初学离散化的一点心得