LeetCode 每日一题：2104. 子数组范围和

2104. 子数组范围和

枚举左右区间的端点，同时维护区间的最值

class Solution {
public:
    long long subArrayRanges(vector<int>& nums) {
        typedef long long LL;
        LL ans = 0;
        int n = nums.size();
        for (int i = 0; i < n; i ++ ) {
            int minn = nums[i], maxn = nums[i];
            for (int j = i + 1; j < n; j ++ ) {
                minn = min(nums[j], minn);
                maxn = max(nums[j], maxn);
                ans += maxn - minn;
            }
        }
        return ans;
    }
};