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.

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

Update 0452.用最少数量的箭引爆气球.md #1444

Merged
merged 1 commit into from
Jul 12, 2022

Conversation

silaslll
Copy link
Contributor

@silaslll silaslll commented Jun 5, 2022

更新了java代码,增加了一个 leftmostRightBound variable 记录最小的右边界使得代码可读性增加
加入了comment
解释了Arrays.sort(points, (x, y) -> Integer.compare(x[0], y[0])); 中不用 x[0] - y[0] 而是用Integer.compare(x[0], y[0]) 的原因
加入了时空复杂度和说明

更新了java代码,增加了一个 leftmostRightBound variable 记录最小的右边界使得代码可读性增加
加入了comment
解释了Arrays.sort(points, (x, y) -> Integer.compare(x[0], y[0])); 中不用 x[0] - y[0] 而是用Integer.compare(x[0], y[0]) 的原因
加入了时空复杂度和说明
@silaslll
Copy link
Contributor Author

silaslll commented Jun 5, 2022

更新了java代码,增加了一个 leftmostRightBound variable 记录最小的右边界使得代码可读性增加
加入了comment
解释了Arrays.sort(points, (x, y) -> Integer.compare(x[0], y[0])); 中不用 x[0] - y[0] 而是用Integer.compare(x[0], y[0]) 的原因
加入了时空复杂度和说明

@youngyangyang04 youngyangyang04 merged commit 1b206a7 into youngyangyang04:master Jul 12, 2022
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.

2 participants