-
Notifications
You must be signed in to change notification settings - Fork 126
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
[highball] week3 solutions #388
Conversation
- time complexitiy: O(n) - space complexitiy: O(1)
- 즉 0부터 더해서 11 되는 알고리즘으로 바꿈
- time complexity : O(n) - space complexity : O(1)
@highballplz 3주차 마감이 임박했으니 PR을 Ready for review로 전환하시고 프로젝트에서 Status를 In Review로 설정 부탁드리겠습니다. |
예 알겠습니다! |
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.
수고하셨습니다. 복잡도 분석도 해보시면 도움이 될 것 같습니다.
예 다음부터는 복잡도 분석도 해보겠습니다. 감사합니다! |
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.