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주차] 백제완 #314

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 jewan100:main
Feb 23, 2025
Merged

[23주차] 백제완 #314

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

Conversation

Copy link
Contributor

@jewan100 jewan100 commented Feb 17, 2025

리뷰 부탁드립니다~~!

@jewan100 jewan100 self-assigned this Feb 17, 2025
Copy link
Contributor

KodaHye commented Feb 20, 2025
edited by jewan100
Loading

코드 더 주세요 기브 미 어 코드 🙌

코드 드렸습니다^^

KodaHye reacted with laugh emoji jewan100 reacted with rocket emoji

Copy link
Contributor

@KodaHye KodaHye left a comment
edited by jewan100
Loading

Choose a reason for hiding this comment

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

이 문제 100ms 안으로 진입하고 싶은데, 안되네요 ^_^ ᄒᄒ

근데 코드 더 주세요 🙌

ᄏᄏᄏᄏᄏᄏᄏᄏᄏ 100ms 벽은 못넘어요... 진짜로

for (Map.Entry<Long, Integer> entry : tmA.entrySet()) {
long aSum = entry.getKey();
int aWays = entry.getValue();
Map.Entry<Long, Integer> bEntry = prefixSumB.floorEntry(c - aSum);
Copy link
Contributor

Choose a reason for hiding this comment

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

TreeMap을 이용하는 방법도 있군요. 그리고 floorEntry()를 이용해서 개수를 구할 생각은 못해봤는데 이것도 좋은 아이디어인 것 같습니다

bfs(y, x, nextBoard, visited, nPq); // 유물의 조각이 연결되었는지 확인
return nPq;
}

Copy link
Contributor

Choose a reason for hiding this comment

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

오!! 저도 이렇게 1차랑 2차에 진행하는 bfs를 하나로 통일해서 깔끔하게 짜고싶었는데..! 제가 바라던 이상적인 코드로 작성하셨네요

@jewan100 jewan100 merged commit 27e5bed 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

@KodaHye KodaHye KodaHye approved these changes

@yeongleej yeongleej yeongleej left review comments

@baexxbin baexxbin baexxbin approved these changes

@jmxx219 jmxx219 jmxx219 approved these changes

Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.

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