MCPcopy Create free account
hub / github.com/LjyYano/LeetCode / minPatches

Method minPatches

src/main/java/L0330_PatchingArray.java:40–60  ·  view source on GitHub ↗

贪心算法 时间复杂度：O(m + logn)，其中 m 是数组 nums 的长度 空间复杂度：O(1)

(int[] nums, int n)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

mainMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected