如果嵌套值存在，则对其求和

const data = [
  { value: 1 },
  { value: [2, 3] },
  { value: { nestedValue: 4 } },
  { value: [5, { nestedValue: 6 }] }
];

function sumNestedValues(data) {
  let sum = 0;

  function recurse(item) {
    if (typeof item === 'number') {
      sum += item;
    } else if (Array.isArray(item)) {
      item.forEach(recurse);
    } else if (typeof item === 'object' && item !== null) {
      Object.values(item).forEach(recurse);
    }
  }

  data.forEach(recurse);
  return sum;
}

console.log(sumNestedValues(data)); // 输出: 21

function sumNestedValuesIterative(data) {
  let sum = 0;
  const stack = [...data];

  while (stack.length > 0) {
    const item = stack.pop();
    if (typeof item === 'number') {
      sum += item;
    } else if (Array.isArray(item)) {
      stack.push(...item);
    } else if (typeof item === 'object' && item !== null) {
      stack.push(...Object.values(item));
    }
  }

  return sum;
}

console.log(sumNestedValuesIterative(data)); // 输出: 21