【算法题】单词消消乐（js）

牛客原题链接：https://www.nowcoder.com/practice/abb14fd6e1a34b0fb8016dfd7a99dfc5?tpId=196&&tqId=37249&rp=1&ru=/ta/job-code-total&qru=/ta/job-code-total/question-ranking

本人解法：

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param Words string字符串一维数组
 * @return string字符串
 */
function WordsMerge(Words) {
    // write code here
    let words = [...Words];
    let startArr = words[0].split("");
    for (let i = 1; i < words.length; i++) {
        const wordArr = words[i].split("");
        while (startArr.length && wordArr.length) {
            if (startArr[startArr.length - 1] === wordArr[0]) {
                startArr.pop();
                wordArr.shift();
            } else {
                startArr = [...startArr, ...wordArr];
                break;
            }
        }
    }
    return startArr.join("");
}
module.exports = {
    WordsMerge: WordsMerge,
};