Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

[23주차] 이지영 #313

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

Merged
jewan100 merged 6 commits into GreatAlgorithm-Study:main from yeongleej:main
Feb 23, 2025
Merged

[23주차] 이지영 #313

jewan100 merged 6 commits into GreatAlgorithm-Study:main from yeongleej:main
Feb 23, 2025

Conversation

Copy link
Contributor

@yeongleej yeongleej commented Feb 17, 2025

No description provided.

Comment on lines +218 to +227
public static void fillSpot() {
// 작은 열 -> 큰 행
for(int j=0; j<N; j++) {
for(int i=N-1; i>=0; i--) {
if(g[i][j] == 0) {
g[i][j] = q.poll();
}
}
}
}
Copy link
Contributor

Choose a reason for hiding this comment

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

저는 일차원 배열을 사용하고, idx 값을 계속 바꿔나가는 형식으로 했는데, 큐를 사용해서 계속 값을 뽑는 방법도 좋네요!!

근데 질문이 있는데요! 큐에서 맨 처음 값을 poll 하고 다시 큐에 add하는 과정은 필요 없는건가요?,,, 맨 마지막 숫자를 사용하면 다시 처음의 숫자를 사용해야 되는데, 이 부분을 어떻게 처리하는건지 궁금합니다!

jmxx219 reacted with eyes emoji
Copy link
Contributor Author

@yeongleej yeongleej Feb 18, 2025

Choose a reason for hiding this comment

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

image

여기에 벽면에는 충분히 많은 숫자가 있어서 다 쓸 걱정은 안해도된다길래 ᄒᄒᄒ 큐에서 poll()만 구현했습니다!

KodaHye and jmxx219 reacted with thumbs up emoji jmxx219 and KodaHye reacted with eyes emoji
Copy link
Contributor

Choose a reason for hiding this comment

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

아하!! 제가 문제를 또 대충 읽었군요,, !!!! 감사합니다!

jewan100 reacted with laugh emoji
Copy link
Contributor

@jewan100 jewan100 left a comment
edited
Loading

Choose a reason for hiding this comment

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

깔꼼.😼

if(p >= ((cnt+1)*m)) {
s = i;
e = s + k;

Copy link
Contributor

Choose a reason for hiding this comment

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

오.. 슬라이딩 윈도우로 푸신거 멋있어요! 리뷰때 설명 기대됩니닷!

@jewan100 jewan100 merged commit 36b368c into GreatAlgorithm-Study:main Feb 23, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@baexxbin baexxbin baexxbin approved these changes

@jmxx219 jmxx219 jmxx219 approved these changes

@KodaHye KodaHye KodaHye approved these changes

+1 more reviewer

@jewan100 jewan100 jewan100 approved these changes

Reviewers whose approvals may not affect merge requirements
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

AltStyle によって変換されたページ (->オリジナル) /