Skip to content

Latest commit

 

History

History
42 lines (21 loc) · 766 Bytes

0907-sum-of-subarray-minimums.adoc

File metadata and controls

42 lines (21 loc) · 766 Bytes

907. Sum of Subarray Minimums

{leetcode}/problems/sum-of-subarray-minimums/[LeetCode - Sum of Subarray Minimums^]

Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A.

Since the answer may be large, return the answer modulo 10^9 + 7.

Example 1:

Input: [3,1,2,4]
Output: 17
Explanation: Subarrays are [3], [1], [2], [4], [3,1], [1,2], [2,4], [3,1,2], [1,2,4], [3,1,2,4].
Minimums are 3, 1, 2, 4, 1, 1, 2, 1, 1, 1.  Sum is 17.

Note:

  1. 1 ⇐ A.length ⇐ 30000

  2. 1 ⇐ A[i] ⇐ 30000

link:{sourcedir}/_0907_SumOfSubarrayMinimums.java[role=include]