LeetCode: 383-Counting Bits 解題紀錄
Last Updated on 2022-03-01 by Clay
題目
Given an integerRead More »LeetCode: 383-Counting Bits 解題紀錄n
, return an arrayans
of lengthn + 1
such that for eachi
(0 <= i <= n
),ans[i]
is the number of1
's in the binary representation ofi
.