求2个数组的子集的最大公和

exports.main = async (event, context) => {
  const { array1, array2 } = event; // 从输入参数中获取两个数组

  const m = array1.length;
  const n = array2.length;

  // 初始化dp数组
  const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));

  // 计算dp数组的值
  for (let i = 1; i <= m; i++) {
    for (let j = 1; j <= n; j++) {
      if (array1[i - 1] === array2[j - 1]) {
        dp[i][j] = dp[i - 1][j - 1] + array1[i - 1];
      } else {
        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
      }
    }
  }

  return dp[m][n]; // 返回两个数组的子集的最大公和
};