Skip to content

Latest commit

 

History

History
55 lines (25 loc) · 793 Bytes

README_EN.md

File metadata and controls

55 lines (25 loc) · 793 Bytes

中文文档

Description

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?

Solutions

Python3

Java

...