为了好玩，我提供了一个替代解决方案，首先将字符串转换为数组，然后找到公共后缀。

let a = '123567';
let b = '124567';

function commonSuffix(a, b) {
  let arrayA = [...a].reverse(), arrayB = [...b].reverse();
                
  let match = [];
  arrayA.every((item, i) => arrayB[i] === item && match.unshift(item));
  return match.join('');
}

console.log(commonSuffix(a, b));

你可以使用这个：

function longestCommonSuffix(str1, str2) {
    let i = 0;
    while (i < str1.length && i < str2.length && str1[str1.length - 1 - i] === str2[str2.length - 1 - i]) {
        i++;
    }
    return str1.slice(str1.length - i);
}

// Example usage:
console.log(longestCommonSuffix("programming", "coding")); // Outputs: "ing"
console.log(longestCommonSuffix("hello", "world"));       // Outputs: ""

以相反的顺序迭代两个字符串的字符，直到找到差异。

const commonSuffix = (str1: string, str2: string) => {
    for (let i1 = str1.length - 1, i2 = str2.length - 1; i1 >= 0 && i2 >= 0; i1--, i2--) {
        if (str1[i1] !== str2[i2]) {
            return str1.substr(i1 + 1);
        }
    }
    return str1.length < str2.length ? str1 : str2;
};