Sum of digits under k-ary representation of leetcode simple problem

subject

Give you an integer n（10 Base number ） And a cardinality k , Would you please n from 10 The hexadecimal representation is converted to k Hexadecimal said , Calculate and return the... Of each number after conversion The sum of the .
After the transformation , Your numbers should be taken as 10 Hexadecimal Numbers , And the sum of them should be 10 Hexadecimal means to return .
Example 1：
Input ：n = 34, k = 6
Output ：9
explain ：34 (10 Base number ) stay 6 It is expressed as 54 .5 + 4 = 9 .
Example 2：
Input ：n = 10, k = 10
Output ：1
explain ：n Itself is 10 Base number . 1 + 0 = 1 .
Tips ：
1 <= n <= 100
2 <= k <= 10
source ： Power button （LeetCode）

Their thinking

   Analog decimal to other decimal conversion process , And add the numbers of each bit .

class Solution:
    def sumBase(self, n: int, k: int) -> int:
        s=0 # Count the result of adding each bit 
        while n>0: 
            s+=n%k
            n//=k
        return s

   Of course, it can also be realized by recursion , But the efficiency will decrease .

class Solution:
    def sumBase(self, n: int, k: int) -> int:
        if n<k:
            return n
        else:
            return n%k+self.sumBase(n//k,k)