该博客探讨了LeetCode 2104题目的解决方案，主要关注如何在O(n)的时间复杂度内计算数组所有子数组的范围之和。博主首先介绍了暴力解法，然后提出通过计算所有子数组的最大值和最小值之和来简化问题，并利用单调栈来有效地找出以每个元素为最大值或最小值的子数组个数。通过这种方法，可以避免直接计算所有子数组的范围，从而提高效率。
You are given an integer array nums. The range of a subarray of nums is the difference between the largest and smallest element in the subarray.
Return the sum of all subarray ranges of nums.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1:
Input: nums = [1,2,3] Output: 4 Explanation: The 6 subarrays of nums are the following: [1], range = largest - smallest = 1 - 1 = 0 [2], range = 2 - 2 = 0 [3], range = 3 - 3 = 0 [1,2], range = 2 - 1 = 1 [2,3], range = 3 - 2 = 1 [1,2,3], range = 3 - 1 = 2 So the sum of all ranges is 0 + 0 + 0 + 1 + 1 + 2 = 4.
Example 2:
Input: nums = [1,3,3] Output: 4
最低0.47元/天 解锁文章
138
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
