Skip to content

[LeetCode-1181]使数组严格递增 - Jsss's Blog #13

Description

@CsJsss

https://csjsss.github.io/2021/11/11/%5BLeetCode-1181%5D%E4%BD%BF%E6%95%B0%E7%BB%84%E4%B8%A5%E6%A0%BC%E9%80%92%E5%A2%9E/

原题链接 题目描述给定两个数组, 计算使得数组A严格递增的操作次数。 一次操作定义为: 选数组B任意一个数, 替换数组A任意一个数。

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions