首页 > itarticle > algorithm notes: leetcode#258 add digits

algorithm notes: leetcode#258 add digits

admin 11月 12, 2020 0

Problem

Solution

Analysis

Python implementation

class :
    def addDigits(self, num):
        """
        :type num: int
        :rtype: int
        """
        if num == 0:
            return 0
        if num % 9 == 0:
            return 9
        return num % 9

Java implementation

class  {
    public int addDigits(int num) {
        if(num == 0){ return 0; }
        if(num % 9 == 0){ return 9; }
        return num % 9;
    }
}

Time complexity

O(1).

Space complexity

O(1).

Links

258. Add Digits
(中文版) 算法笔记: 力扣#258 各位相加