任务是计算任何数组元素右侧不同的较小元素的最大数量

function countSmallerElements(arr) {
  let maxCount = 0;
  for (let i = 0; i < arr.length; i++) {
    let count = 0;
    for (let j = i + 1; j < arr.length; j++) {
      if (arr[j] < arr[i] && !arr.slice(i + 1, j).includes(arr[j])) {
        count++;
      }
    }
    if (count > maxCount) {
      maxCount = count;
    }
  }
  return maxCount;
}

const arr = [3, 1, 4, 1, 5, 9, 2, 6, 5];
const maxCount = countSmallerElements(arr);
console.log("最大数量:", maxCount);