如何在Typescript中输入一个返回2个或更多字符串数组交集的递归函数？

function findArrayIntersection(arr1: string[], arr2: string[]): string[] {
  const result: string[] = [];

  // Base case: if any of the arrays is empty, return an empty array
  if (arr1.length === 0 || arr2.length === 0) {
    return result;
  }

  // Check if the first element of arr1 exists in arr2
  const firstElement = arr1[0];
  if (arr2.includes(firstElement)) {
    result.push(firstElement);
  }

  // Recursive case: call the function again with the remaining elements of both arrays
  const remainingArr1 = arr1.slice(1);
  const remainingArr2 = arr2.slice(1);
  const remainingResult = findArrayIntersection(remainingArr1, remainingArr2);

  // Concatenate the intersection of the remaining arrays with the current result
  return result.concat(remainingResult);
}

// Example usage
const array1 = ['a', 'b', 'c', 'd'];
const array2 = ['b', 'd', 'e', 'f'];
const array3 = ['c', 'e', 'g', 'h'];
const intersection = findArrayIntersection(array1, array2);
console.log(intersection); // Output: ['b', 'd']