Skip to content
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.

Sign up for GitHub

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

Jump to bottom

[Algorithm] Knapsack 알고리즘 #70

Merged
merged 3 commits into from
Sep 4, 2021
Merged

[Algorithm] Knapsack 알고리즘 #70

merged 3 commits into from
Sep 4, 2021

Conversation

KimKwon
Copy link
Collaborator

@KimKwon KimKwon commented Aug 15, 2021 •
edited
Loading

변경 사항

  1. Knapsack 알고리즘 종류
  2. 0-1 Knapsack 정리

Issue 참고 : Note Status Check

Point of discussion

  • 은근히 어렵더군요.
  • 열심히 정리해보았습니다.

Reference

null

yoongoing
yoongoing approved these changes Aug 16, 2021
View reviewed changes
Copy link
Collaborator

@yoongoing yoongoing left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

오.. 한번읽고 바로 이해가 되었습니다. 이런 알고리즘도 있네요!

ggjae
ggjae approved these changes Aug 18, 2021
View reviewed changes
Copy link
Collaborator

@ggjae ggjae left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

오랜만에 냅색을 접하네요. :) 잘 보았습니다 주섭님것과 같이 보니 이해가 쉽네요~

Hee-Jae
Hee-Jae reviewed Aug 23, 2021
View reviewed changes
contents/algorithm/basic.md
1. 다음 보석을 배낭에 담을 수 없다.
2. 다음 보석을 배낭에 담을 수 있다.
2-1. 다른 보석을 빼고 현재 보석을 담는다.
2-2. 다른 보석과 함께 현재 보석을 담는다.
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

이 부분이 한줄로 나옵니다. 의도하신 것과 다른 것 같아요.

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

감사합니다. 수정했어요 🎉

Hee-Jae
Hee-Jae approved these changes Aug 24, 2021
View reviewed changes
Copy link
Collaborator

@Hee-Jae Hee-Jae left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

역시 디피는 항상 설명들으면 쉬워지는 마법...

JuseobJang
JuseobJang approved these changes Sep 4, 2021
View reviewed changes
Copy link
Collaborator

@JuseobJang JuseobJang left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

옛날 강의 때 진짜 겨우 이해했는데 다시 보니깐 또 어렵네요,,, 헷갈리긴 하지만 그래도 다시한번 이해 할 수 있는 좋은 기회였어요!!! knapsack(i,w) 이게 코드 상에서는 2차원 배열로 작용 하겠군요 !

@Seogeurim Seogeurim merged commit 8931811 into main Sep 4, 2021
@Seogeurim Seogeurim deleted the Algorithm/KwonHJ branch September 4, 2021 19:41
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@yoongoing yoongoing yoongoing approved these changes

@Hee-Jae Hee-Jae Hee-Jae approved these changes

@ggjae ggjae ggjae approved these changes

@JuseobJang JuseobJang JuseobJang approved these changes

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
6 participants
@KimKwon @JuseobJang @ggjae @Hee-Jae @yoongoing @Seogeurim