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

[fix][java] minimum-number-of-arrows-to-burst-balloons #1596

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

[fix][java] minimum-number-of-arrows-to-burst-balloons #1596

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion 多语言解法代码/solution_code.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42442,7 +42442,8 @@ class Solution {
// 按 end 升序排序
Arrays.sort(intvs, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
return a[1] - b[1];
// Compare as Long values
return Long.compare(a[1], b[1]);
}
});
// 至少有一个区间不相交
Expand Down