LeetCode --- 1588. Sum of All Odd Length Subarrays 解题报告

杨鑫newlfe

于 2023-01-04 00:31:51 发布

阅读量389

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 算法 LeetCode 文章标签： leetcode 算法数据结构面试数组处理

本文链接：https://blog.csdn.net/u012965373/article/details/128541482

算法同时被 3 个专栏收录

850 篇文章 ¥9.90 ¥99.00

订阅专栏

Python

714 篇文章 ¥9.90 ¥99.00

订阅专栏

LeetCode

438 篇文章

订阅专栏

这篇博客详细介绍了LeetCode中的第1588题，即求解所有奇数长度子数组之和的问题。通过给出的示例，展示了如何对给定的正整数数组进行处理，找出所有连续的奇数长度子序列，并计算它们的总和。文章探讨了不同解题策略，并对时间复杂度进行了讨论，提出了在O(n)时间内解决此问题的可能性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of positive integers arr, return the sum of all possible odd-length subarrays of arr.

A subarray is a contiguous subsequence of the array.

Example 1:

Input: arr = [1,4,2,5,3]
Output: 58
Explanation: The odd-length subarrays of arr and their sums are:
[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
If we add all these together we get 1 + 4 + 2 + 5 + 3 + 7 + 11 + 10 + 15 = 58

Example 2:

Input: arr = [1,2]
Output: 3
Explanation: There are

了解本专栏