-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path330.patching-array.py
More file actions
69 lines (66 loc) · 1.3 KB
/
Copy path330.patching-array.py
File metadata and controls
69 lines (66 loc) · 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#
# @lc app=leetcode id=330 lang=python3
#
# [330] Patching Array
#
# https://leetcode.com/problems/patching-array/description/
#
# algorithms
# Hard (35.51%)
# Likes: 830
# Dislikes: 96
# Total Accepted: 46.1K
# Total Submissions: 123.8K
# Testcase Example: '[1,3]\n6'
#
# Given a sorted integer array nums and an integer n, add/patch elements to the
# array such that any number in the range [1, n] inclusive can be formed by the
# sum of some elements in the array.
#
# Return the minimum number of patches required.
#
#
# Example 1:
#
#
# Input: nums = [1,3], n = 6
# Output: 1
# Explanation:
# Combinations of nums are [1], [3], [1,3], which form possible sums of: 1, 3,
# 4.
# Now if we add/patch 2 to nums, the combinations are: [1], [2], [3], [1,3],
# [2,3], [1,2,3].
# Possible sums are 1, 2, 3, 4, 5, 6, which now covers the range [1, 6].
# So we only need 1 patch.
#
#
# Example 2:
#
#
# Input: nums = [1,5,10], n = 20
# Output: 2
# Explanation: The two patches can be [2, 4].
#
#
# Example 3:
#
#
# Input: nums = [1,2,2], n = 5
# Output: 0
#
#
#
# Constraints:
#
#
# 1 <= nums.length <= 1000
# 1 <= nums[i] <= 10^4
# nums is sorted in ascending order.
# 1 <= n <= 2^31 - 1
#
#
#
# @lc code=start
class Solution:
def minPatches(self, nums: List[int], n: int) -> int:
# @lc code=end