mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-26 02:00:27 +08:00
100 lines
2.5 KiB
HTML
100 lines
2.5 KiB
HTML
|
<p>给你一个整数数组 <code>nums</code> ，一个整数 <code>k</code> 和一个整数 <code>multiplier</code> 。</p>
|
|||
|
|
|
|||
|
|
<p>你需要对 <code>nums</code> 执行 <code>k</code> 次操作，每次操作中：</p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>找到 <code>nums</code> 中的 <strong>最小</strong> 值 <code>x</code> ，如果存在多个最小值，选择最 <strong>前面</strong> 的一个。</li>
|
|||
|
|
<li>将 <code>x</code> 替换为 <code>x * multiplier</code> 。</li>
|
|||
|
|
</ul>
|
|||
|
|
|
|||
|
|
<p><code>k</code> 次操作以后，你需要将 <code>nums</code> 中每一个数值对 <code>10<sup>9</sup> + 7</code> 取余。</p>
|
|||
|
|
|
|||
|
|
<p>请你返回执行完 <code>k</code> 次乘运算以及取余运算之后，最终的 <code>nums</code> 数组。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>nums = [2,1,3,5,6], k = 5, multiplier = 2</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>[8,4,6,5,6]</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<table>
|
|||
|
|
<tbody>
|
|||
|
|
<tr>
|
|||
|
|
<th>操作</th>
|
|||
|
|
<th>结果</th>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>1 次操作后</td>
|
|||
|
|
<td>[2, 2, 3, 5, 6]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>2 次操作后</td>
|
|||
|
|
<td>[4, 2, 3, 5, 6]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>3 次操作后</td>
|
|||
|
|
<td>[4, 4, 3, 5, 6]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>4 次操作后</td>
|
|||
|
|
<td>[4, 4, 6, 5, 6]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>5 次操作后</td>
|
|||
|
|
<td>[8, 4, 6, 5, 6]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>取余操作后</td>
|
|||
|
|
<td>[8, 4, 6, 5, 6]</td>
|
|||
|
|
</tr>
|
|||
|
|
</tbody>
|
|||
|
|
</table>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p><strong class="example">示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<div class="example-block">
|
|||
|
|
<p><span class="example-io"><b>输入：</b>nums = [100000,2000], k = 2, multiplier = 1000000</span></p>
|
|||
|
|
|
|||
|
|
<p><span class="example-io"><b>输出：</b>[999999307,999999993]</span></p>
|
|||
|
|
|
|||
|
|
<p><strong>解释：</strong></p>
|
|||
|
|
|
|||
|
|
<table>
|
|||
|
|
<tbody>
|
|||
|
|
<tr>
|
|||
|
|
<th>操作</th>
|
|||
|
|
<th>结果</th>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>1 次操作后</td>
|
|||
|
|
<td>[100000, 2000000000]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>2 次操作后</td>
|
|||
|
|
<td>[100000000000, 2000000000]</td>
|
|||
|
|
</tr>
|
|||
|
|
<tr>
|
|||
|
|
<td>取余操作后</td>
|
|||
|
|
<td>[999999307, 999999993]</td>
|
|||
|
|
</tr>
|
|||
|
|
</tbody>
|
|||
|
|
</table>
|
|||
|
|
</div>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li><code>1 <= nums.length <= 10<sup>4</sup></code></li>
|
|||
|
|
<li><code>1 <= nums[i] <= 10<sup>9</sup></code></li>
|
|||
|
|
<li><code>1 <= k <= 10<sup>9</sup></code></li>
|
|||
|
|
<li><code>1 <= multiplier <= 10<sup>6</sup></code></li>
|
|||
|
|
</ul>
|