mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
58 lines
1.7 KiB
HTML
58 lines
1.7 KiB
HTML
<p>给你一个整数数组 <code>nums</code> 。<code>nums</code> 中，子数组的 <strong>范围</strong> 是子数组中最大元素和最小元素的差值。</p>
|
||
|
||
<p>返回 <code>nums</code> 中 <strong>所有</strong> 子数组范围的 <strong>和</strong> <em>。</em></p>
|
||
|
||
<p>子数组是数组中一个连续 <strong>非空</strong> 的元素序列。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [1,2,3]
|
||
<strong>输出：</strong>4
|
||
<strong>解释：</strong>nums 的 6 个子数组如下所示：
|
||
[1]，范围 = 最大 - 最小 = 1 - 1 = 0
|
||
[2]，范围 = 2 - 2 = 0
|
||
[3]，范围 = 3 - 3 = 0
|
||
[1,2]，范围 = 2 - 1 = 1
|
||
[2,3]，范围 = 3 - 2 = 1
|
||
[1,2,3]，范围 = 3 - 1 = 2
|
||
所有范围的和是 0 + 0 + 0 + 1 + 1 + 2 = 4</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [1,3,3]
|
||
<strong>输出：</strong>4
|
||
<strong>解释：</strong>nums 的 6 个子数组如下所示：
|
||
[1]，范围 = 最大 - 最小 = 1 - 1 = 0
|
||
[3]，范围 = 3 - 3 = 0
|
||
[3]，范围 = 3 - 3 = 0
|
||
[1,3]，范围 = 3 - 1 = 2
|
||
[3,3]，范围 = 3 - 3 = 0
|
||
[1,3,3]，范围 = 3 - 1 = 2
|
||
所有范围的和是 0 + 0 + 0 + 2 + 0 + 2 = 4
|
||
</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>nums = [4,-2,-3,4,1]
|
||
<strong>输出：</strong>59
|
||
<strong>解释：</strong>nums 中所有子数组范围的和是 59
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= nums.length <= 1000</code></li>
|
||
<li><code>-10<sup>9</sup> <= nums[i] <= 10<sup>9</sup></code></li>
|
||
</ul>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>进阶：</strong>你可以设计一种时间复杂度为 <code>O(n)</code> 的解决方案吗？</p>
|