查找数组中从最大到最小再到最大的距离

查找数组中从最大到最小再到最大的距离

let a=[1,5,5,2,6]; // 4   5,5,2,6
let b=[1,1]; // 2 1,1
let d=[2,6,8,5]; // 3  2,6,8

function distance(ary) {
  let res = [];
  for(let i= 0;i<ary.length;i++){
    res.push(judge(ary[i],i,ary));
  }
  return Math.max(...res);
}

function judge(num,i,ary){
  let left = 0;
  let right = 0;
  let m =i;
  while (i>=1) {
    i--;
    if(ary[i]>= num){
      num = ary[i]
      left++;
    }else{
      break
    }
  }
  while (m<ary.length-1) {
    m++;
    if(ary[m]>= num){
      num = ary[m]
      right++
    }else{
      break
    }
  }
  return left + right + 1;
}

console.log(distance(a));
console.log(distance(b));
console.log(distance(d));