Add Digits LeetCode Solution | Easy Approach

Minimum Cost to Merge Stones
Share:

Add Digits Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

Example 1:

Input: num = 38
Output: 2
Explanation: The process is
38 --> 3 + 8 --> 11
11 --> 1 + 1 --> 2 
Since 2 has only one digit, return it.

Example 2:

Input: num = 0
Output: 0

Constraints:

  • 0 <= num <= 231 - 1

Add Digits Solutions

Time: O(1)
Space: O(1)

C++

class Solution {
 public:
  int addDigits(int num) {
    return 1 + (num - 1) % 9;
  }
};

Java

 class Solution {
  public int addDigits(int num) {
    return 1 + (num - 1) % 9;
  }
}

Python

class Solution:
  def addDigits(self, num: int) -> int:
    return 0 if num == 0 else 1 + (num - 1) % 9

Watch Tutorial

Checkout more Solutions here

Leave a Comment

Your email address will not be published. Required fields are marked *

x