mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
47 lines
1.5 KiB
HTML
47 lines
1.5 KiB
HTML
<p>You are given an array <code>target</code> of n integers. From a starting array <code>arr</code> consisting of <code>n</code> 1's, you may perform the following procedure :</p>
|
|
|
|
<ul>
|
|
<li>let <code>x</code> be the sum of all elements currently in your array.</li>
|
|
<li>choose index <code>i</code>, such that <code>0 <= i < n</code> and set the value of <code>arr</code> at index <code>i</code> to <code>x</code>.</li>
|
|
<li>You may repeat this procedure as many times as needed.</li>
|
|
</ul>
|
|
|
|
<p>Return <code>true</code> <em>if it is possible to construct the</em> <code>target</code> <em>array from</em> <code>arr</code><em>, otherwise, return</em> <code>false</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> target = [9,3,5]
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> Start with arr = [1, 1, 1]
|
|
[1, 1, 1], sum = 3 choose index 1
|
|
[1, 3, 1], sum = 5 choose index 2
|
|
[1, 3, 5], sum = 9 choose index 0
|
|
[9, 3, 5] Done
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> target = [1,1,1,2]
|
|
<strong>Output:</strong> false
|
|
<strong>Explanation:</strong> Impossible to create target array from [1,1,1,1].
|
|
</pre>
|
|
|
|
<p><strong>Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> target = [8,5]
|
|
<strong>Output:</strong> true
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>n == target.length</code></li>
|
|
<li><code>1 <= n <= 5 * 10<sup>4</sup></code></li>
|
|
<li><code>1 <= target[i] <= 10<sup>9</sup></code></li>
|
|
</ul>
|