代码拉取完成,页面将自动刷新
同步操作将从 小墨/力扣题库(完整版) 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
<p>You are given an array <code>target</code> and an integer <code>n</code>.</p>
<p>In each iteration, you will read a number from <code>list = [1, 2, 3, ..., n]</code>.</p>
<p>Build the <code>target</code> array using the following operations:</p>
<ul>
<li><code>"Push"</code>: Reads a new element from the beginning list, and pushes it in the array.</li>
<li><code>"Pop"</code>: Deletes the last element of the array.</li>
<li>If the target array is already built, stop reading more elements.</li>
</ul>
<p>Return <em>a list of the operations needed to build </em><code>target</code>. The test cases are generated so that the answer is <strong>unique</strong>.</p>
<p> </p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> target = [1,3], n = 3
<strong>Output:</strong> ["Push","Push","Pop","Push"]
<strong>Explanation:</strong>
Read number 1 and automatically push in the array -> [1]
Read number 2 and automatically push in the array then Pop it -> [1]
Read number 3 and automatically push in the array -> [1,3]
</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> target = [1,2,3], n = 3
<strong>Output:</strong> ["Push","Push","Push"]
</pre>
<p><strong>Example 3:</strong></p>
<pre>
<strong>Input:</strong> target = [1,2], n = 4
<strong>Output:</strong> ["Push","Push"]
<strong>Explanation:</strong> You only need to read the first 2 numbers and stop.
</pre>
<p> </p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= target.length <= 100</code></li>
<li><code>1 <= n <= 100</code></li>
<li><code>1 <= target[i] <= n</code></li>
<li><code>target</code> is strictly increasing.</li>
</ul>
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。