-
-
Notifications
You must be signed in to change notification settings - Fork 258
[DaleSeo] WEEK 08 solutions (워크플로우 테스트 용) #1969
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.
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
Draft
DaleSeo
wants to merge
1
commit into
DaleStudy:main
Choose a base branch
from
DaleSeo:main
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Draft
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,19 @@ | ||
| // TC: O(1) | ||
| // SC: O(1) | ||
| impl Solution { | ||
| pub fn reverse_bits(n: i32) -> i32 { | ||
| let mut result = 0u32; | ||
| let mut num = n as u32; | ||
|
|
||
| for i in 0..32 { | ||
| // Extract the least significant bit | ||
| let bit = num & 1; | ||
| // Place it in the reversed position | ||
| result |= bit << (31 - i); | ||
| // Shift num right to process the next bit | ||
| num >>= 1; | ||
| } | ||
|
|
||
| result as i32 | ||
| } | ||
| } | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@DaleStudy 복잡도 분석이 정확해?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
안녕하세요! 새로운 솔루션을 잘 구현하셨네요. 시간 복잡도는 입력 크기(고정된 32비트)에 따라 O(1)로 적절히 표기하셨고, 공간 복잡도도 O(1)로 적합합니다. 가독성도 좋아서 이해하기 쉽고, 주석도 명확하게 달려 있어 좋습니다. 다만, 혹시 더 최적화하거나 다른 방법을 고려한다면, 비트 연산 대신 라이브러리 함수를 사용할 수도 있지만, 이 방식이 가장 직관적이고 효율적입니다. 앞으로도 다양한 접근법을 시도하며 연습하시면 좋겠습니다. 계속해서 좋은 코드 기대할게요!