Counting Bits LeetCode solution in Java

1
class Solution {
2

3
  public void count(int n, int[] a, int k) {
4
    int i;
5
    for (i = k; i < k * 2 && i <= n; i++) a[i] = a[i - k] + 1;
6
    if (i == n + 1) return;
7
    count(n, a, k * 2);
8
  }
9

10
  public int[] countBits(int n) {
11
    int a[] = new int[n + 1];
12
    a[0] = 0;
13
    count(n, a, 1);
14
    return a;
15
  }
16
}