Minimum Number of Increments on Subarrays to Form a Target Array LeetCode solution in JavaScript

1
var minNumberOperations = function (target) {
2
  let res = target[0];
3
  for (let g = 1; g < target.length; g++) {
4
    if (target[g] > target[g - 1]) {
5
      res = res + (target[g] - target[g - 1]);
6
    }
7
    // for target[g] < target[g-1] we need not worry as its already been taken care by previous iterations
8
  }
9
  return res;
10
};