[PG_17681] 비밀지도 풀이 #3
Merged
Conversation
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
[이해민] 꽉 자바 첫 주 프로그래머스 17681번
Yoepee
reviewed
Jul 1, 2025
Member
Yoepee
left a comment
Yoepee
left a comment
There was a problem hiding this comment.
IMHO
toBinaryString이랑 replace를 사용하면 좀 더 편하게 만들 수 있을 것 같습니다.
Yoepee
approved these changes
Jul 1, 2025
jjuchan
reviewed
Jul 1, 2025
|
|
||
| // 이진수는 뒤에서부터 채워야 하므로, 배열의 끝에서부터 채움 | ||
| for (int i = 0; i < length; i++) { | ||
| answer[length - i - 1] = value % 2; // 2로 나눈 나머지를 저장 (0 또는 1) |
Collaborator
There was a problem hiding this comment.
저라면 귀찮아서 toBinaryString 써서 풀었을 것 같은데.. 대단하십니다 .. 직접 구현하는 방법 알고 갑니다!
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
📌 문제 링크
✨ 풀이 요약