mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
45 lines
1.2 KiB
HTML
45 lines
1.2 KiB
HTML
<p>给你一个正整数数组 <code>arr</code> ，请你计算所有可能的奇数长度子数组的和。</p>
|
||
|
||
<p><strong>子数组</strong> 定义为原数组中的一个连续子序列。</p>
|
||
|
||
<p>请你返回 <code>arr</code> 中 <strong>所有奇数长度子数组的和</strong> 。</p>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>示例 1：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>arr = [1,4,2,5,3]
|
||
<strong>输出：</strong>58
|
||
<strong>解释：</strong>所有奇数长度子数组和它们的和为：
|
||
[1] = 1
|
||
[4] = 4
|
||
[2] = 2
|
||
[5] = 5
|
||
[3] = 3
|
||
[1,4,2] = 7
|
||
[4,2,5] = 11
|
||
[2,5,3] = 10
|
||
[1,4,2,5,3] = 15
|
||
我们将所有值求和得到 1 + 4 + 2 + 5 + 3 + 7 + 11 + 10 + 15 = 58</pre>
|
||
|
||
<p><strong>示例 2：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>arr = [1,2]
|
||
<strong>输出：</strong>3
|
||
<strong>解释：</strong>总共只有 2 个长度为奇数的子数组，[1] 和 [2]。它们的和为 3 。</pre>
|
||
|
||
<p><strong>示例 3：</strong></p>
|
||
|
||
<pre><strong>输入：</strong>arr = [10,11,12]
|
||
<strong>输出：</strong>66
|
||
</pre>
|
||
|
||
<p> </p>
|
||
|
||
<p><strong>提示：</strong></p>
|
||
|
||
<ul>
|
||
<li><code>1 <= arr.length <= 100</code></li>
|
||
<li><code>1 <= arr[i] <= 1000</code></li>
|
||
</ul>
|