Longest Continuous Increasing Subsequence LeetCode solution in JavaScript

1
var findLengthOfLCIS = function (nums) {
2
  let res = 0;
3
  let curr = 1;
4

5
  nums.forEach((num, idx) => {
6
    if (num < nums[idx + 1]) {
7
      curr++;
8
    } else curr = 1;
9

10
    res = Math.max(res, curr);
11
  });
12

13
  return res;
14
};