20. 有效的括号 ● 1047. 删除字符串中的所有相邻重复项 ● 150. 逆波兰表达式求值

20. 有效的括号

用栈来解决括号匹配问题

class Solution {
    public boolean isValid(String s) {
        char[] ch = s.toCharArray();
        Stack<Character> stack = new Stack<>();
        for(int i = 0; i < ch.length; i++){
            if(ch[i] == '(' || ch[i] == '[' || ch[i] == '{'){
                stack.push(ch[i]);
            }else{
                if(stack.isEmpty()) return false;
                char temp = stack.pop();
                if(ch[i] == ')' && temp != '(')return false;
                if(ch[i] == ']' && temp != '[')return false;
                if(ch[i] == '}' && temp != '{')return false;
            }
        }
        return stack.isEmpty();
    }
}

另一种：eg在遇到’(‘时压入’)‘， 后面遇到’)'直接比较就行

150 逆波兰表达式求值

栈

class Solution {
    public int evalRPN(String[] tokens) {
        Stack<String> stack = new Stack<>();
        for(int i = 0; i < tokens.length; i++){
            if(tokens[i].equals("*") ){
                int a = parseInt(stack.pop());
                int b = parseInt(stack.pop());
                stack.push(a * b +"");
            }else if(tokens[i].equals("/")){
                int a = parseInt(stack.pop());
                int b = parseInt(stack.pop());
                stack.push(b / a + "");
            }else if(tokens[i].equals("+")){
                int a = parseInt(stack.pop());
                int b = parseInt(stack.pop());
                stack.push(b + a + "");
            }else if(tokens[i].equals("-")){
                int a = parseInt(stack.pop());
                int b = parseInt(stack.pop());
                stack.push(b - a + "");
            }else{
                stack.push(tokens[i]);
            }
        }
        return parseInt(stack.pop()) ;

    }
    public int parseInt(String str){
        return Integer.parseInt(str);
    }
}

数组代替栈
在遇到运算符时，index需要–，下次的数据进来时候覆盖掉原先的值

class Solution {
    public int evalRPN(String[] tokens) {
        int[] stack = new int[(tokens.length+1 )/2];
        int index = 0;
        for(int i = 0; i < tokens.length; i++){
            if(tokens[i].equals("*") ){
                index--;
                stack[index - 1] *= stack[index];
            }else if(tokens[i].equals("/")){
                index--;
                stack[index - 1] /= stack[index];
            }else if(tokens[i].equals("+")){
                index--;
                stack[index - 1] += stack[index];
            }else if(tokens[i].equals("-")){
                index--;
                stack[index - 1] -= stack[index];
            }else{
                stack[index++] = parseInt(tokens[i]);
            }
        }
        return stack[0] ;

    }
    public int parseInt(String str){
        return Integer.parseInt(str);
    }
}