题解 | #点击消除#
点击消除
http://www.nowcoder.com/practice/8d3643ec29654cf8908b5cf3a0479fd5
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner input = new Scanner(System.in);
String target = input.next();
char cur;
Stack<Character> stack = new Stack<>();
for(int i = 0; i < target.length(); i++){
cur = target.charAt(i);
//将每个字符存入栈中，存的时候判断要不要消除
if(stack.isEmpty()){
stack.push(cur);
}else{
//如果相同，就消除，否则就入栈
if(stack.peek()==cur){
stack.pop();
}else{
stack.push(cur);
}
}
}
if(stack.isEmpty()){
System.out.println(0);
}else{
StringBuilder sb = new StringBuilder();
int len = stack.size();
for(int i = 0; i < len; i++){
sb.append(stack.pop());
}
//反转输出
System.out.println(sb.reverse().toString());
}
}
}
，
查看19道真题和解析
