coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 10:51:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
leetcode-cn/problem (Chinese)/翻转子数组得到最大的数组值 [reverse-subarray-to-maximize-array-value].html
View File

@@ -8,14 +8,16 @@
<p><strong>示例 1：</strong></p>
<pre><strong>输入：</strong>nums = [2,3,1,5,4]
<pre>
<strong>输入：</strong>nums = [2,3,1,5,4]
<strong>输出：</strong>10
<strong>解释：</strong>通过翻转子数组 [3,1,5] ，数组变成 [2,5,1,3,4] ，数组值为 10 。
</pre>
<p><strong>示例 2：</strong></p>
<pre><strong>输入：</strong>nums = [2,4,9,24,2,1,10]
<pre>
<strong>输入：</strong>nums = [2,4,9,24,2,1,10]
<strong>输出：</strong>68
</pre>
@@ -24,6 +26,7 @@
<p><strong>提示：</strong></p>
<ul>
<li><code>1 &lt;= nums.length &lt;= 3*10^4</code></li>
<li><code>-10^5 &lt;= nums[i] &lt;= 10^5</code></li>
<li><code>2 &lt;= nums.length &lt;= 3*10<sup>4</sup></code></li>
<li><code>-10<sup>5</sup> &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
<li>答案保证在 32 位整数范围内。</li>
</ul>