-
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
[donghyeon95] Week 7 #953
[donghyeon95] Week 7 #953
Conversation
int newX = x + move[0]; | ||
int newY = y + move[1]; |
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.
오.. 이러면 테두리 경계값을 따로 확인하지 않아도 넘어갈 일이 없겠군요..!
ListNode result = null; | ||
|
||
while(head != null) { | ||
ListNode nextNode = new ListNode(head.val); |
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.
ListNode nextNode = head.next
로 한다면 공간 복잡도를 O(1) 으로 줄일 수 있지 않을까요?
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.
7주차 문제 풀이 고생하셨습니다.
같은 자바 사용자로서 코드 리뷰하면서 가독성이 좋아 편했습니다!
시간적 여유가 있으시다면 시간, 공간 복잡도 표기 및 그에 대한 이유도 함께 적어주시면 더욱 좋을것 같습니다.
8주차 새해 복 많이 받으시고 문제 풀이도 파이팅입니다!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.