[LeetCode] 907. Sum of Subarray Minimums 子数组最小值之和

Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. Since the answer may be large, return