Skip to content

1837. Sum of Digits in Base K 👍

  • Time: $O(\log n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
class Solution {
 public:
  int sumBase(int n, int k) {
    int ans = 0;

    while (n > 0) {
      ans += n % k;
      n /= k;
    }

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
class Solution {
  public int sumBase(int n, int k) {
    int ans = 0;

    while (n > 0) {
      ans += n % k;
      n /= k;
    }

    return ans;
  }
}

1
2
3
4
5
6
7
8
9
class Solution:
  def sumBase(self, n: int, k: int) -> int:
    ans = 0

    while n > 0:
      ans += n % k
      n //= k

    return ans