入门算法第1天第1题 AB5 点击消除

根据栈顶和输入的字符比较，相同则pop，不同则push；

import java.util.Scanner;
import java.util.Stack;

public class KuoHao {

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        Stack<Character> strings = new Stack<>();
        Stack<Character> stringss = new Stack<>();
        while (in.hasNext()) { // 注意 while 处理多个 case
            String String = in.next();

            char[] chars = String.toCharArray();

            for (int i = 0; i < chars.length; i++) {
                if (!strings.isEmpty()){
                    Character pop = strings.pop();
                    if (pop.equals(chars[i])){

                    }else{
                        strings.push(pop);
                        strings.push(chars[i]);
                    }
                }else {
                    strings.push(chars[i]);
                }
            }

					//将栈逆转，然后使用StringBuffer
            for (int i = 0; i < strings.size(); ) {
                stringss.push(strings.pop());
            }

            if (stringss.isEmpty()){
                System.out.println(0);
            }else{
                StringBuffer sb=new StringBuffer();
                for (int i = 0; i < stringss.size();) {
                    sb.append(stringss.pop());
                }

                java.lang.String s = sb.toString();
                System.out.println(s);
            }




        }

    }

}

总结，使用StringBuffer将栈append为字符串然后输出