函数在每个子数组中搜索最小值

function searchMinValueInSubarrays(arr) {
  const result = [];
  
  for (let i = 0; i < arr.length; i++) {
    let min = arr[i][0];
    
    for (let j = 1; j < arr[i].length; j++) {
      if (arr[i][j] < min) {
        min = arr[i][j];
      }
    }
    
    result.push(min);
  }
  
  return result;
}

const arr = [[3, 5, 2, 8], [1, 6, 4], [9, 7, 2, 5, 3]];
const result = searchMinValueInSubarrays(arr);
console.log(result); // 输出 [2, 1, 2]