1
// O(n^3) time | O(1) space
2
var subArrayRanges = function (nums) {
3
  let res = 0;
4
  for (let i = 1; i < nums.length; i++) {
5
    for (let j = 0; j < i; j++) {
6
      let smallest = nums[i],
7
        biggest = nums[i];
8
      for (let k = j; k < i; k++) {
9
        smallest = Math.min(smallest, nums[k]);
10
        biggest = Math.max(biggest, nums[k]);
11
      }
12
      res += biggest - smallest;
13
    }
14
  }
15
  return res;
16
};