728x90
반응형
[LeetCode - Daily Challenge] 330. Patching Array

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem 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 ..
Algorithm/LeetCode Daily Challenge 2021. 8. 30. 10:59
728x90
반응형
1