재귀와 동적계획법 과제 제출 #11
Open
재귀와 동적계획법 과제 제출 #11
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
hannut91
approved these changes
Dec 11, 2023
| // return acc; | ||
| // }; | ||
|
|
||
| const solution = (numbers) => numbers.reduce((acc, cur) => acc + cur, 0); |
Contributor
There was a problem hiding this comment.
꼬리 재귀 함수는 모두 reduce함수로 구현이 가능하다는 것을 이용해 구현하셨네요 ㅎㅎ 좋습니다
| // break; | ||
| // } | ||
|
|
||
| // acc += numbers.pop(); |
Contributor
There was a problem hiding this comment.
numbers.pop()은 원본 배열을 수정하는 메서드입니다. 만약 다른 곳에서 numbers를 참조하고 있었다면 예상하지 못한 일이 일어날 수 있을 것 같아요.
Author
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
2 participants
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.
우선 1~3번, 6번 문제만 풀어보았습니다.
콜스택을 그려가며 문제를 풀다보니까 재귀의 동작에 대해 이해도가 높아졌습니다.
재귀와 꼬리재귀 그리고 동적계획법으로 이어지는 최적화의 과정이 재미있었습니다.