如何在对象数组中找到某项的最高匹配率？

function findHighestMatch(targetItem, objectArray) {
  let highestMatchRate = 0;
  let bestMatchItem = null;

  for (let i = 0; i < objectArray.length; i++) {
    const currentItem = objectArray[i];
    const matchRate = calculateMatchRate(targetItem, currentItem);

    if (matchRate > highestMatchRate) {
      highestMatchRate = matchRate;
      bestMatchItem = currentItem;
    }
  }

  return bestMatchItem;
}

function calculateMatchRate(targetItem, currentItem) {
  // 根据具体需求计算匹配率的方法
  // 可以使用字符串相似度算法或其他算法来计算匹配率
  // 这里仅作示例，假设目标项和当前项都是字符串，使用Levenshtein距离计算相似度
  const distance = levenshteinDistance(targetItem, currentItem);
  const maxLength = Math.max(targetItem.length, currentItem.length);
  const matchRate = 1 - distance / maxLength;

  return matchRate;
}

// 示例的Levenshtein距离计算函数
function levenshteinDistance(a, b) {
  const dp = Array.from(Array(a.length + 1), () => Array(b.length + 1).fill(0));

  for (let i = 0; i <= a.length; i++) {
    dp[i][0] = i;
  }

  for (let j = 0; j <= b.length; j++) {
    dp[0][j] = j;
  }

  for (let i = 1; i <= a.length; i++) {
    for (let j = 1; j <= b.length; j++) {
      if (a[i - 1] === b[j - 1]) {
        dp[i][j] = dp[i - 1][j - 1];
      } else {
        dp[i][j] = Math.min(
          dp[i - 1][j - 1] + 1,
          dp[i][j - 1] + 1,
          dp[i - 1][j] + 1
        );
      }
    }
  }

  return dp[a.length][b.length];
}

// 示例用法
const targetItem = "example";
const objectArray = [
  { name: "example1", value: 0.8 },
  { name: "example2", value: 0.6 },
  { name: "example3", value: 0.9 },
];

const bestMatchItem = findHighestMatch(targetItem, objectArray);
console.log(bestMatchItem);