JS求数组里连续递增的最长长度

function countLen(arr) {
  if (arr.length === 0) {
    return 0;
  }
  //首先进入当前连续长度nowLen设初始化为1，最大连续长度maxLen初始化为0
  let nowLen = 1;
  let maxLen = 0;
  for (let i = 1, len = arr.length; i < len; i++) {
    if (arr[i] > arr[i - 1]) {
      nowLen++;
    } else {
      if (maxLen < nowLen) {
        maxLen = nowLen;
      }
      nowLen = 1;
    }
  }
  if (maxLen < nowLen) {
    maxLen = nowLen;
  }
  //返回最大连续长度
  return maxLen;
}