Skip to content

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

Open
@github-actions

Description

@github-actions

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions