Javascript 按升序对字符串数组进行排序并判断序列

const sortAndCheckSequence = (value) => {
  let data = [...value];

  sortedData = data.sort((a, b) => (a > b ? 1 : -1));

  const removeCommonPrefix = (a, b) => {
    const minLen = Math.min(a.length, b.length);

    let i = 0;
    while (i < minLen && a[i] === b[i]) ++i;

    return [a.substr(0, i), a.substr(i), b.substr(i)];
  }

  const FindError = (sortedData) => {
    for (let i = 1; i < sortedData.length; ++i) {
      const [prevValue, value] = [sortedData[i - 1], sortedData[i]];

      if (value === prevValue)
        return `Duplicate ${value}`;

      const [prefix, prevSuffix, suffix] = removeCommonPrefix(prevValue, value);

      if (prevSuffix === "") {
        if (suffix !== ".1")
          return `Expected ${prevValue}.1, got ${value}`;
      } else if (suffix !== String(parseInt(prevSuffix) + 1)) {
        return `Expected ${prefix}${parseInt(prevSuffix) + 1}, got ${value}`;
      }
    }
    return null; // no error
  }

  const error = FindError(sortedData);
  console.log(error || "No error");

  return error === null; // Does the sequence pass the check without any errors?
}

sortAndCheckSequence(['1', '1.1', '1.1.1', '1.2', '2', '3', '3.1']); // true
sortAndCheckSequence(['1', '1.1', '1.1.1', '1.2', '2', '2.1', '3', '4', '5']); // true
sortAndCheckSequence(['1', '1.1', '1.1.1', '1.1.1.1', '1.1.1.2', '1.2', '3', '3.1']); // false: 2 is missing
sortAndCheckSequence(['1', '1.1', '1.1.1', '1.2', '2', '2.1', '3', '4', '4.1', '5', '5.1.1']); // false '5.1' missing 
sortAndCheckSequence(['1', '1.1', '1.1.1', '1.2', '2', '2.1', '3', '4', '5', '1.2']); // false '1.2' is duplicate
sortAndCheckSequence(['1', '1.1', '1.1.1', '1.2', '1.4', '2', '3', '3.1']); // false '1.3' missing
sortAndCheckSequence(['1', '1.1', '1.1.1', '1.1.2', '1.2', '1.3', '1.4', '2', '2.1', '9', '3', '3.1']); //false '9' is not in sequence