https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string/
栈应用的简单题,注意最后出栈顺序相反,所以要倒转一下字符串。
class Solution {
public String removeDuplicates(String s) {
Stack<Character> queue = new Stack<>();
StringBuffer res = new StringBuffer();
int len = s.length();
for(int i =0; i < len; i++){
if(!queue.isEmpty() && s.charAt(i) == queue.peek()){
queue.pop();
}
else queue.push(s.charAt(i));
}
while(!queue.isEmpty()){
System.out.println(queue.peek());
res.append(queue.pop());
}
return res.reverse().toString();
}
}