patching-array

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a sorted integer array <code>nums</code> and an integer <code>n</code>, add/patch elements to the array such that any number in the range <code>[1, n]</code> inclusive can be formed by the sum of some elements in the array.

Return the minimum number of patches required.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

<pre>
Input: nums = [1,5,10], n = 20
Output: 2
Explanation: The two patches can be [2, 4].
</pre>

Example 3:

<pre>
Input: nums = [1,2,2], n = 5
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> is sorted in ascending order.</li>
	<li><code>1 &lt;= n &lt;= 231 - 1</code></li>
</ul>

minPatches

Patching Array

Maximum Number of Consecutive Values You Can Make

maximum-number-of-consecutive-values-you-can-make

你能构造出连续值的最大数目

Greedy

Array

&#32473;&#23450;&#19968;&#20010;&#24050;&#25490;&#24207;&#30340;&#27491;&#25972;&#25968;&#25968;&#32452; <code>nums</code>&nbsp;&#65292;&#21644;&#19968;&#20010;&#27491;&#25972;&#25968;&nbsp;<code>n</code> &#12290;&#20174;&nbsp;<code>[1, n]</code>&nbsp;&#21306;&#38388;&#20869;&#36873;&#21462;&#20219;&#24847;&#20010;&#25968;&#23383;&#34917;&#20805;&#21040;&nbsp;nums&nbsp;&#20013;&#65292;&#20351;&#24471;&nbsp;<code>[1, n]</code>&nbsp;&#21306;&#38388;&#20869;&#30340;&#20219;&#20309;&#25968;&#23383;&#37117;&#21487;&#20197;&#29992;&nbsp;nums&nbsp;&#20013;&#26576;&#20960;&#20010;&#25968;&#23383;&#30340;&#21644;&#26469;&#34920;&#31034;&#12290;

&#35831;&#36820;&#22238; &#28385;&#36275;&#19978;&#36848;&#35201;&#27714;&#30340;&#26368;&#23569;&#38656;&#35201;&#34917;&#20805;&#30340;&#25968;&#23383;&#20010;&#25968;&nbsp;&#12290;

&nbsp;

&#31034;&#20363;&nbsp;1:

<pre>
&#36755;&#20837;: nums = <code>[1,3]</code>, n = <code>6</code>
&#36755;&#20986;: 1 
&#35299;&#37322;:
&#26681;&#25454; nums&nbsp;&#37324;&#29616;&#26377;&#30340;&#32452;&#21512;&nbsp;<code>[1], [3], [1,3]</code>&#65292;&#21487;&#20197;&#24471;&#20986;&nbsp;<code>1, 3, 4</code>&#12290;
&#29616;&#22312;&#22914;&#26524;&#25105;&#20204;&#23558;&nbsp;<code>2</code>&nbsp;&#28155;&#21152;&#21040;&nbsp;nums &#20013;&#65292;&nbsp;&#32452;&#21512;&#21464;&#20026;: <code>[1], [2], [3], [1,3], [2,3], [1,2,3]</code>&#12290;
&#20854;&#21644;&#21487;&#20197;&#34920;&#31034;&#25968;&#23383;&nbsp;<code>1, 2, 3, 4, 5, 6</code>&#65292;&#33021;&#22815;&#35206;&#30422;&nbsp;<code>[1, 6]</code>&nbsp;&#21306;&#38388;&#37324;&#25152;&#26377;&#30340;&#25968;&#12290;
&#25152;&#20197;&#25105;&#20204;&#26368;&#23569;&#38656;&#35201;&#28155;&#21152;&#19968;&#20010;&#25968;&#23383;&#12290;</pre>

&#31034;&#20363; 2:

<pre>
&#36755;&#20837;: nums = <code>[1,5,10]</code>, n = <code>20</code>
&#36755;&#20986;: 2
&#35299;&#37322;: &#25105;&#20204;&#38656;&#35201;&#28155;&#21152;&nbsp;<code>[2,4]</code>&#12290;
</pre>

&#31034;&#20363;&nbsp;3:

<pre>
&#36755;&#20837;: nums = <code>[1,2,2]</code>, n = <code>5</code>
&#36755;&#20986;: 0
</pre>

&nbsp;

&#25552;&#31034;&#65306;

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code>&nbsp;&#25353; &#21319;&#24207;&#25490;&#21015;</li>
	<li><code>1 &lt;= n &lt;= 231&nbsp;- 1</code></li>
</ul>

Sunbelt Computer Software

PL/B Language Development and Support