- 博客(1)
- 收藏
- 关注
原创 leetcode 907. 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...
2019-06-16 21:32:25 440
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人