Skip to content

[Lustellz] WEEK 14 solution #1956

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 28, 2025
Merged

[Lustellz] WEEK 14 solution #1956

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions counting-bits/Lustellz.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
// Runtime: 6mx
// Memory: 61.10MB

function countBits(n: number): number[] {
let answer: number[] = Array(n + 1).fill(0);

for(let i = 1 ; i <= n ; i++){
let tmp = i;
while (tmp > 0){
answer[i] += tmp % 2
tmp = Math.floor(tmp / 2)
}
Comment on lines +8 to +12
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

문제 설명의 **Follow up:**처럼 O(nlogn) 시간을 O(n)으로 줄일 수 있어요:

Suggested change
let tmp = i;
while (tmp > 0){
answer[i] += tmp % 2
tmp = Math.floor(tmp / 2)
}
answer[i] = answer[Math.floor(i / 2)] + (i % 2);

또는 i >> 1과 i & 1을 사용해도 좋습니다.

}

return answer;
};