-
-
Notifications
You must be signed in to change notification settings - Fork 195
[구문영(GUMUNYEONG)] WEEK 2 Solution #357
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
Conversation
GUMUNYEONG
commented
Aug 22, 2024
- Valid Anagram
- Counting Bits
- Encode and Decode Strings
- Construct Binary Tree From Preorder And Inorder Traversal
- Decode Ways
복잡도 분석은 코드에 추가하여 다시 올리겠습니다 |
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.
수고하셨습니다!
valid-anagram/GUMUNYEONG.js
Outdated
} else { | ||
result = false; | ||
break; | ||
} | ||
} | ||
|
||
return result; |
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.
요렇게 하시면 더 깔끔하고 효율적인 코드가 되지 않을까 생각이 들었습니다 :)
} else { | |
result = false; | |
break; | |
} | |
} | |
return result; | |
} else { | |
return false; | |
} | |
} | |
return true; |
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.
앗 더 간단하게 표현할 수 있었네요..! 피드백 감사합니다! :>