[220421] 풀이추가 2개, 코드 삭제 1개, 주석수정 1개 #39
Merged
Conversation
This file contains 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
기존의 정답3 재원님의 코드는 다른문제의 해답입니다.(수박수박수박수박수박수.js)
codeisneverodd
approved these changes
Apr 21, 2022
| } |
There was a problem hiding this comment.
찾아주셔서 감사합니다! 더 꼼꼼히 리뷰해야겠네요!! 😿
Comment on lines
+51
to
+54
| repeat() 메서드는 문자열을 주어진 횟수만큼 반복해 붙인 새로운 문자열을 반환한다. ex) str.repeat(count); | ||
| '*'.repeat(a) : *를 a만큼 반복한다. | ||
| */ |
| let count = 0; | ||
| while (num !== 1) { | ||
| if (count++ === 500) return -1; |
There was a problem hiding this comment.
++ 연산자를 활용한 풀이 너무 깔끔한데요? 배워갑니다 😄
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.
No description provided.