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

[6주차] 배수빈 #78

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 9 commits into main from xubin
Oct 19, 2024
Merged

[6주차] 배수빈 #78

jewan100 merged 9 commits into main from xubin
Oct 19, 2024

Conversation

Copy link
Contributor

@baexxbin baexxbin commented Oct 14, 2024

No description provided.

Copy link
Contributor

Choose a reason for hiding this comment

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

저는 i 시작을 0으로 설정해줘서, 범위에 벗어나면 continue를 해주었는데
i 시작을 처음부터 c로 시작해주면 되군요!!

baexxbin reacted with thumbs up emoji
public static int solution(int n, int[][] costs) {
Arrays.sort(costs, (o1, o2)->{
return o1[2]-o2[2];
});
Copy link
Contributor

Choose a reason for hiding this comment

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

따로 Queue를 사용하지 않고 배열을 정렬해서 풀이하신 것 좋습니다,,,,👍

Copy link
Contributor Author

Choose a reason for hiding this comment

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

히히 감사합니돠아😊

@jewan100 jewan100 merged commit 1ea7038 into main Oct 19, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@KodaHye KodaHye KodaHye left review comments

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

Successfully merging this pull request may close these issues.

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