created another solution for problem67

Author: dampdigits

problem67/Solution0.java

@@ -0,0 +1,13 @@
+class Solution {
+    public int[] countBits(int n) {
+        int[] ans = new int[n+1];
+        int offset = 1;
+
+        for (int i = 1; i <= n; i++) {
+            if ((offset << 1) == i) offset = i;
+            ans[i] = 1 + ans[i-offset];
+        }
+
+        return ans;
+    }
+}