leetcode1047字符串反复去重(栈)
点击查看代码
/**
* @param {string} s
* @return {string}
*/
let removeDuplicates = function (s) {
let stack = []
for (let v of s) {
if (stack.length && stack.at(-1) === v) {
stack.pop()
} else {
stack.push(v)
}
}
return stack.join('')
};
本文来自博客园,作者:jialiangzai,转载请注明原文链接:https://www.cnblogs.com/zsnhweb/articles/17966515