We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c2b493d commit 242bb93Copy full SHA for 242bb93
1 file changed
counting-bits/hoyeongkwak.ts
@@ -1,18 +1,11 @@
1
-function levelOrder(root: TreeNode | null): number[][] {
2
- if (root == null) return []
3
- const result: number[][] = []
4
- let queue: TreeNode[] = [root]
5
- while (queue.length > 0) {
6
- const levelSize = queue.length
7
- const currentLevel: number[] = []
8
- for(let i = 0; i< levelSize; i++) {
9
- const node = queue.shift()!
10
- currentLevel.push(node.val)
11
-
12
- if (node.left) queue.push(node.left)
13
- if (node.right) queue.push(node.right)
14
- }
15
- result.push(currentLevel)
+/*
+Time Complexity: O(n)
+Space Complexity: O(n)
+*/
+function countBits(n: number): number[] {
+ const result: number[] = new Array(n + 1).fill(0)
+ for(let i = 1; i <= n; i++) {
+ result[i] = result[i >> 1] + (i & 1)
16
}
17
return result
18
-}
+};
0 commit comments