Skip to content

Conversation

baexxbin
Copy link
Contributor

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로 시작해주면 되군요!!

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
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants