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

Jump to bottom

Title: 两个线段获得的最多奖品(Maximize Win From Two Segments) #285

Open

github-actions bot opened this issue Sep 11, 2024 · 0 comments

Labels

github-actions bot commented Sep 11, 2024

Difficulty: Medium
Tags: 数组(Array)、二分查找(Binary Search)、滑动窗口(Sliding Window)
Link: https://leetcode.com/problems/maximize-win-from-two-segments
LinkCN: https://leetcode.cn/problems/maximize-win-from-two-segments

github-actions bot added the leetcode label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment