#1047. Remove All Adjacent Duplicates In String
Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.
We repeatedly make duplicate removals on S until we no longer can.
Return the final string after all such duplicate removals have been made. It is guaranteed the answer is unique.
Example 1:
Input: “abbaca”
Output: “ca”
Explanation:
For example, in “abbaca” we could remove “bb” since the letters are adjacent and equal, and this is the only possible move. The result of this move is that the string is “aaca”, of which only “aa” is possible, so the final string is “ca”.
用堆栈的思路来解决问题,如果即将放进去的和最后一个放进去的是一样的,就把两个都pop出来,如果不一样,就push进去
/**
* @param {string} S
* @return {string}
*/
var removeDuplicates = function(S) {
var result = [];
for(var i=0;i<S.length;i++) {
if(result.length>0 && result[result.length-1]===S[i] ) {
result.pop();
}
else {
result.push(S[i]);
}
}
return result.join("");
};